The following pages link to Optimizing over the split closure (Q2476990):
Displaying 50 items.
- Characterization of the split closure via geometric lifting (Q319191) (← links)
- Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
- Bilevel programming and the separation problem (Q403662) (← links)
- A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts (Q433114) (← links)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- On the enumerative nature of Gomory's dual cutting plane method (Q607496) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- Lexicography and degeneracy: Can a pure cutting plane algorithm work? (Q647393) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
- Improved strategies for branching on general disjunctions (Q652284) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- How to select a small set of diverse solutions to mixed integer programming problems (Q833594) (← links)
- MIP reformulations of the probabilistic set covering problem (Q847820) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- Cut generation through binarization (Q896284) (← links)
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter (Q958548) (← links)
- Erratum to: MIR closures of polyhedral sets (Q964184) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants (Q1043853) (← 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)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- Split cuts from sparse disjunctions (Q2195684) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
- MIPping closures: An instant survey (Q2373443) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579) (← links)
- Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← 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)
- A Probabilistic Analysis of the Strength of the Split and Triangle Closures (Q3009748) (← links)
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs (Q4646443) (← links)
- Multirow Intersection Cuts Based on the Infinity Norm (Q5084619) (← links)
- Optimal Cutting Planes from the Group Relaxations (Q5108238) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)
- Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow (Q5256763) (← links)
- Virtual private network design over the first Chvátal closure (Q5501875) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
