On the domino-parity inequalities for the STSP
type: Item
instance of: scholarly article
title: On the domino-parity inequalities for the STSP
zbMATH Open document ID: 1206.90135
author: Sylvia Boyd
author: Sally Cockburn
author: Danielle Vella
published in: Mathematical Programming. Series A. Series B
publication date: 2010-07-21T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5758804
zbMATH Keywords: cutting planes
zbMATH Keywords: valid inequalities
describes a project that uses: Concorde
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: s10107-006-0011-6
OpenAlex ID: W2043340090
cites work: Q4735941
cites work: On the separation of maximally violated mod-\(k\) cuts
cites work: Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
cites work: Separating maximally violated comb inequalities in planar graphs
cites work: 2-change for k-connected networks
cites work: On the symmetric travelling salesman problem I: Inequalities
cites work: On the symmetric travelling salesman problem II: Lifting theorems and facets
cites work: Faster shortest-path algorithms for planar graphs
cites work: Q3693290
cites work: Q4845366
cites work: Separating a superclass of comb inequalities in planar graphs
cites work: Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
cites work: Q3714901
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: Facet identification for the symmetric traveling salesman polytope
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: TSPLIB—A Traveling Salesman Problem Library
DOI: 10.1007/S10107-006-0011-6
description: scientific article; zbMATH DE number 5758804