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

DOI10.1007/3-540-61310-2_34MaRDI QIDQ4645942zbMATH OpenOpenAlexFDO

Authors

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)

Recommendations

• Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation
• Separating clique tree and bipartition inequalities in polynomial time
• Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
• Separating a superclass of comb inequalities in planar graphs
• Some results on node lifting of TSP inequalities

Cites work

• Expressing combinatorial optimization problems by linear programs
• scientific article; zbMATH DE number 795217 (Why is no real title available?)
• On some connectivity properties of Eulerian graphs
• Random sampling in cut, flow, and network design problems
• Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
• Small Travelling Salesman Polytopes
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope

Cited in

(12)

• Some results on node lifting of TSP inequalities
• Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
• Separation of cycle inequalities in periodic timetabling
• On Pedigree Polytopes and Hamiltonian Cycles
• Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
• Separation of cycle inequalities for the periodic timetabling problem
• Separating clique tree and bipartition inequalities in polynomial time
• On the \({\mathcal {H}}\)-free extension complexity of the TSP
• Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation
• 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

This page was built for publication: Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645942)