Separating clique tree and bipartition inequalities in polynomial time

DOI10.1007/3-540-59408-6_40MaRDI QIDQ5101404zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
• Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
• Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
• Separating a superclass of comb inequalities in planar graphs
• Separating maximally violated comb inequalities in planar graphs

Cites work

• Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
• Facet identification for the symmetric traveling salesman polytope
• scientific article; zbMATH DE number 795217 (Why is no real title available?)
• Odd Minimum Cut-Sets and b-Matchings
• Small Travelling Salesman Polytopes
• The Binested Inequalities for the Symmetric Traveling Salesman Polytope

Cited in

(12)

• Binary clutter inequalities for integer programs
• Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
• Separation of cycle inequalities in periodic timetabling
• A new separation algorithm for the Boolean quadric and cut polytopes
• On pedigree polytopes and Hamiltonian cycles
• Separation algorithm for tree partitioning inequalities
• Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
• An exact exponential time algorithm for counting bipartite cliques
• The solution of the gravitational n-body problem
• Separation of cycle inequalities for the periodic timetabling problem
• Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
• Separating maximally violated comb inequalities in planar graphs

This page was built for publication: Separating clique tree and bipartition inequalities in polynomial time

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