The following pages link to MIR closures of polyhedral sets (Q847821):
Displaying 34 items.
- On the polyhedrality of cross and quadrilateral closures (Q344941) (← links)
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- On the enumerative nature of Gomory's dual cutting plane method (Q607496) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- A note on the MIR closure and basic relaxations of polyhedra (Q635512) (← links)
- On convergence in mixed integer programming (Q715071) (← links)
- Cut generation through binarization (Q896284) (← links)
- A note on the MIR closure (Q924876) (← links)
- Erratum to: MIR closures of polyhedral sets (Q964184) (← links)
- On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
- Equivalence between intersection cuts and the corner polyhedron (Q974981) (← links)
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants (Q1043853) (← links)
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- On the relative strength of different generalizations of split cuts (Q1751106) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- Split cuts and extended formulations for mixed integer conic quadratic programming (Q1785310) (← links)
- Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- Split cuts from sparse disjunctions (Q2195684) (← links)
- The split closure of a strictly convex body (Q2275578) (← links)
- MIPping closures: An instant survey (Q2373443) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579) (← links)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- Optimal Cutting Planes from the Group Relaxations (Q5108238) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)
- Virtual private network design over the first Chvátal closure (Q5501875) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- Continuous cutting plane algorithms in integer programming (Q6047699) (← links)
