Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
From MaRDI portal
Publication:1611004
DOI10.1007/s101070100275zbMath1007.90053OpenAlexW1997949329MaRDI QIDQ1611004
Publication date: 20 August 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100275
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A branch-and-cut algorithm for the preemptive swapping problem, A note on the polytope of bipartite TSP, Heuristic and exact algorithms for a min-max selective vehicle routing problem, The undirected \(m\)-capacitated peripatetic salesman problem, Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem, A branch‐and‐cut algorithm for the nonpreemptive swapping problem, On the domino-parity inequalities for the STSP, Optimization of a peer-to-peer system for efficient content replication, Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized, The 2-edge-connected subgraph polyhedron
