Pages that link to "Item:Q922950"
From MaRDI portal
The following pages link to Chvátal closures for mixed integer programming problems (Q922950):
Displayed 20 items.
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- A note on the MIR closure (Q924876) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- Cook, Kannan and Schrijver's example revisited (Q955332) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Split closure and intersection cuts (Q1774172) (← links)
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944) (← links)
- MIPping closures: An instant survey (Q2373443) (← links)
- Sequential pairing of mixed integer inequalities (Q2471272) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- A convex-analysis perspective on disjunctive cuts (Q2492679) (← links)
- A note on the continuous mixing set (Q2517804) (← links)
- A constructive characterization of the split closure of a mixed integer linear program (Q2643814) (← links)
- Computing with Multi-row Gomory Cuts (Q3503849) (← links)
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles (Q3503866) (← links)
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints (Q5458539) (← links)
- Elementary closures for integer programs. (Q5937498) (← links)