Pages that link to "Item:Q3699731"

The following pages link to Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope (Q3699731):

Displaying 12 items.

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