Polynomial-Time Separation of a Superclass of Simple Comb Inequalities

DOI10.1287/moor.1060.0214zbMath1278.90337OpenAlexW2137063489WikidataQ57702306 ScholiaQ57702306MaRDI QIDQ5388004

Lisa K. Fleischer, Adam N. Letchford, Andrea Lodi

Publication date: 27 May 2008

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/589ac0056e43e6efdc551285091c2dcba339f536

zbMATH Keywords

traveling salesman problemcutting planesseparation

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

Facets from gadgets ⋮ Exploiting planarity in separation routines for the symmetric traveling salesman problem ⋮ On the \({\mathcal {H}}\)-free extension complexity of the TSP

This page was built for publication: Polynomial-Time Separation of a Superclass of Simple Comb Inequalities