Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
From MaRDI portal
Publication:1611005
DOI10.1007/s101070100276zbMath1094.90041OpenAlexW1977889042MaRDI QIDQ1611005
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (2)
Generating subtour elimination constraints for the TSP from pure integer solutions ⋮ The 2-edge-connected subgraph polyhedron
Uses Software
This page was built for publication: Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
