Separating a Superclass of Comb Inequalities in Planar Graphs

DOI10.1287/moor.25.3.443.12213zbMath0977.90075OpenAlexW2145340898WikidataQ57702391 ScholiaQ57702391MaRDI QIDQ2757646

Adam N. Letchford

Publication date: 26 November 2001

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

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

zbMATH Keywords

valid inequalitiesbranch-and-cutseparation algorithmsymmetric travelling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (7)

Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) ⋮ Good triangulations yield good tours ⋮ Exploiting planarity in separation routines for the symmetric traveling salesman problem ⋮ On the domino-parity inequalities for the STSP ⋮ Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs ⋮ Certification of an optimal TSP tour through 85,900 cities ⋮ Computing in combinatorial optimization

This page was built for publication: Separating a Superclass of Comb Inequalities in Planar Graphs