Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time

DOI10.1287/moor.22.2.257zbMath0883.90102OpenAlexW1990603750MaRDI QIDQ4346221

No author found.

Publication date: 3 August 1997

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

Full work available at URL: https://doi.org/10.1287/moor.22.2.257

zbMATH Keywords

traveling salesmancutting planesclique tree inequalitiesbipartition inequalities

Mathematics Subject Classification ID

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

Related Items (6)

Facets from gadgets ⋮ Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts ⋮ Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time ⋮ Exploiting planarity in separation routines for the symmetric traveling salesman problem ⋮ On the domino-parity inequalities for the STSP ⋮ Computing in combinatorial optimization

This page was built for publication: Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time