Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope

DOI10.1287/MOOR.10.2.359zbMATH Open0578.05057OpenAlexW2037735152MaRDI QIDQ3699731FDOQ3699731

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

Recommendations

• Facets of the Bipartite Subgraph Polytope
• Wheel inequalities for stable set polytopes
• Separating subdivision of bicycle wheel inequalities over cut polytopes
• Polyhedral results for the bipartite induced subgraph problem
• Separation problems for the stable set polytope

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)

Cited In (13)

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

This page was built for publication: Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3699731)