Separating maximally violated comb inequalities in planar graphs

DOI10.1007/3-540-61310-2_35zbMath1415.90062OpenAlexW1795699505MaRDI QIDQ4645943

Lisa K. Fleischer, Éva Tardos

Publication date: 11 January 2019

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

Full work available at URL: https://hdl.handle.net/1813/9034

zbMATH Keywords

Hamiltonian cycleplanar graphseparation algorithmfractional solutiontravel salesman problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of large-scale symmetric travelling salesman problems
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• Separating Maximally Violated Comb Inequalities in Planar Graphs
• Augmenting undirected connectivity in RNC and in randomized Õ(n³) time
• Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
• On the symmetric travelling salesman problem I: Inequalities
• On the symmetric travelling salesman problem II: Lifting theorems and facets
• On the symmetric travelling salesman problem: Solution of a 120-city problem
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• Separating clique tree and bipartition inequalities in polynomial time
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: Separating maximally violated comb inequalities in planar graphs