Separating Maximally Violated Comb Inequalities in Planar Graphs

DOI10.1287/moor.24.1.130zbMath0977.90071OpenAlexW2006851287MaRDI QIDQ2757587

Lisa K. Fleischer, Éva Tardos

Publication date: 26 November 2001

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

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

zbMATH Keywords

separation algorithmstraveling salesman problemcutting planescomb inequalities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (8)

Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) ⋮ Good triangulations yield good tours ⋮ Separating maximally violated comb inequalities in planar graphs ⋮ Exploiting planarity in separation routines for the symmetric traveling salesman problem ⋮ On the domino-parity inequalities for the STSP ⋮ The general routing polyhedron: A unifying framework ⋮ Computing in combinatorial optimization ⋮ The rural postman problem with deadline classes

This page was built for publication: Separating Maximally Violated Comb Inequalities in Planar Graphs