Pages that link to "Item:Q1306466"
From MaRDI portal
The following pages link to Separating subdivision of bicycle wheel inequalities over cut polytopes (Q1306466):
Displaying 10 items.
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- Faster separation of 1-wheel inequalities by graph products (Q496437) (← links)
- Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← 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)
- Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope (Q3699731) (← links)
- Separation of Cycle Inequalities for the Periodic Timetabling Problem (Q4606290) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- (Q5708566) (← links)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← links)