Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
From MaRDI portal
Publication:1611005
DOI10.1007/S101070100276zbMATH Open1094.90041OpenAlexW1977889042MaRDI QIDQ1611005FDOQ1611005
Authors: Stefan Thienel, Denis Naddef 
Publication date: 15 September 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100276
Recommendations
- Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
- Separating a superclass of comb inequalities in planar graphs
- Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
- Separating clique tree and bipartition inequalities in polynomial time
- Exploiting planarity in separation routines for the symmetric traveling salesman problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cited In (10)
- Separating maximally violated comb inequalities in planar graphs
- Generating subtour elimination constraints for the TSP from pure integer solutions
- The 2-edge-connected subgraph polyhedron
- Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation
- Separating clique tree and bipartition inequalities in polynomial time
- Separating maximally violated comb inequalities in planar graphs
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
- 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: Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1611005)
