Separating multi-oddity constrained shortest circuits over the polytope of stable multisets.

DOI10.1016/j.orl.2003.05.001zbMath1036.90071OpenAlexW2052346730MaRDI QIDQ1417599

Eddie Cheng, Sven de Vries

Publication date: 5 January 2004

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2003.05.001

zbMATH Keywords

stable set problemefficient separation algorithmodd valued odd cycle inequalitystable multiset problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

On cycles and the stable multi-set polytope

Cites Work

• Weakly bipartite graphs and the max-cut problem
• Geometric algorithms and combinatorial optimization
• Wheel inequalities for stable set polytopes
• Stable multi-sets
• Antiweb-wheel inequalities and their separation problems over the stable set polytopes
• Design and Implementation of an Interactive Optimization System for Telephone Network Planning
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing

This page was built for publication: Separating multi-oddity constrained shortest circuits over the polytope of stable multisets.