Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time

DOI10.1007/3-540-61310-2_34zbMath1415.90061OpenAlexW1576649545MaRDI 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

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope, Exploiting planarity in separation routines for the symmetric traveling salesman problem, On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem, On Pedigree Polytopes and Hamiltonian Cycles

Cites Work

• Unnamed Item
• Expressing combinatorial optimization problems by linear programs
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope
• Random sampling in cut, flow, and network design problems
• Small Travelling Salesman Polytopes
• On some connectivity properties of Eulerian graphs
• Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time