Separating clique tree and bipartition inequalities in polynomial time

DOI10.1007/3-540-59408-6_40zbMath1498.90183OpenAlexW1597374843MaRDI QIDQ5101404

Robert D. Carr

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_40

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

Separating maximally violated comb inequalities in planar graphs, The solution of the gravitational n-body problem, On pedigree polytopes and Hamiltonian cycles

Cites Work

• Unnamed Item
• Facet identification for the symmetric traveling salesman polytope
• Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
• Odd Minimum Cut-Sets and b-Matchings
• Small Travelling Salesman Polytopes
• The Binested Inequalities for the Symmetric Traveling Salesman Polytope