On the domino-parity inequalities for the STSP

DOI10.1007/S10107-006-0011-6MaRDI QIDQ985309zbMATH OpenOpenAlexFDO

Authors Sylvia Boyd, Sally Cockburn, Danielle Vella

Publication date 21 July 2010

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-006-0011-6

zbMATH Keywords

cutting planesvalid inequalities

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• Computing with domino-parity inequalities for the traveling salesman problem (TSP)
• A Study of Domino-Parity and k-Parity Constraints for the TSP
• The domino inequalities: facets for the symmetric traveling salesman polytope
• scientific article; zbMATH DE number 2196282
• Generalized domino-parity inequalities for the symmetric traveling salesman problem

Cites work

• scientific article; zbMATH DE number 3918121 (Why is no real title available?)
• scientific article; zbMATH DE number 3943560 (Why is no real title available?)
• scientific article; zbMATH DE number 2084783 (Why is no real title available?)
• scientific article; zbMATH DE number 795217 (Why is no real title available?)
• 2-change for k-connected networks
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
• Facet identification for the symmetric traveling salesman polytope
• Faster shortest-path algorithms for planar graphs
• Odd Minimum Cut-Sets and b-Matchings
• On the separation of maximally violated mod-\(k\) cuts
• On the symmetric travelling salesman problem I: Inequalities
• On the symmetric travelling salesman problem II: Lifting theorems and facets
• Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
• Separating a superclass of comb inequalities in planar graphs
• Separating maximally violated comb inequalities in planar graphs
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(6)

• A Study of Domino-Parity and k-Parity Constraints for the TSP
• Computing with domino-parity inequalities for the traveling salesman problem (TSP)
• Generalized domino-parity inequalities for the symmetric traveling salesman problem
• scientific article; zbMATH DE number 2196282 (Why is no real title available?)
• scientific article; zbMATH DE number 3876591 (Why is no real title available?)
• Exploiting planarity in separation routines for the symmetric traveling salesman problem

Describes a project that uses

Uses Software

• Concorde
• TSPLIB

This page was built for publication: On the domino-parity inequalities for the STSP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985309)