Pages that link to "Item:Q5952319"
From MaRDI portal
The following pages link to On disjunctive cuts for combinatorial optimization (Q5952319):
Displayed 13 items.
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- Constraint qualification failure in action (Q1694785) (← links)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- Facets from gadgets (Q2220662) (← 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)
- Approximate fixed-rank closures of covering problems (Q2583148) (← links)
- Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)