On the domino-parity inequalities for the STSP
From MaRDI portal
Publication:985309
DOI10.1007/S10107-006-0011-6zbMATH Open1206.90135OpenAlexW2043340090MaRDI QIDQ985309FDOQ985309
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
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- On the symmetric travelling salesman problem I: Inequalities
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- Facet identification for the symmetric traveling salesman polytope
- Odd Minimum Cut-Sets and b-Matchings
- Faster shortest-path algorithms for planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the separation of maximally violated mod-\(k\) cuts
- Title not available (Why is that?)
- Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
- Title not available (Why is that?)
- Separating maximally violated comb inequalities in planar graphs
- Separating a superclass of comb inequalities in planar graphs
- Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
- 2-change for k-connected networks
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem
Uses Software
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)
