Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
From MaRDI portal
Publication:4645942
DOI10.1007/3-540-61310-2_34zbMath1415.90061MaRDI QIDQ4645942
No author found.
Publication date: 11 January 2019
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61310-2_34
Related Items
On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem, Exploiting planarity in separation routines for the symmetric traveling salesman problem, On Pedigree Polytopes and Hamiltonian Cycles