Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope

Published Online:https://doi.org/10.1287/moor.10.2.359

In their paper on facets of the bipartite subgraph polytope Barahona, Grötschel and Mahjoub pose the question: Is there a polynomial time algorithm testing the odd bicycle wheel inequalities? This note describes such an algorithm.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.