Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope

DOI10.1287/moor.10.2.359zbMath0578.05057OpenAlexW2037735152MaRDI QIDQ3699731

A. M. H. Gerards

Publication date: 1985

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

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

zbMATH Keywords

polyhedral combinatoricsbipartite subgraphbicycle wheel

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Polytopes and polyhedra (52B99)

Related Items

The Boolean Quadric Polytope, Computational study of valid inequalities for the maximum \(k\)-cut problem, On cutting-plane proofs in combinatorial optimization, Generalised 2-circulant inequalities for the max-cut problem, A note on the 2-circulant inequalities for the MAX-cut problem, Lifting and separation procedures for the cut polytope, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Projection results for the \(k\)-partition problem, Compositions in the bipartite subgraph polytope, A new separation algorithm for the Boolean quadric and cut polytopes, Separating subdivision of bicycle wheel inequalities over cut polytopes, \(K_ i\)-covers. I: Complexity and polytopes