Optimizing over the split closure
From MaRDI portal
Recommendations
Cites work
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- A study of the lot-sizing polytope
- An exact algorithm for the capacitated facility location problems with single sourcing
- Chvátal closures for mixed integer programming problems
- Disjunctive Programming
- Elementary closures for integer programs.
- Flow pack facets of the single node fixed-charge flow polytope
- Lift-and-project for mixed 0-1 programming: recent progress
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- On the separation of split cuts and related inequalities
- Optimizing over the First Chvàtal Closure
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Split closure and intersection cuts
- The Homotopy Principle and Algorithms for Linear Programming
- The vertex separator problem: a polyhedral investigation
- The vertex separator problem: algorithms and computations
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
Cited in
(54)- Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
- How to select a small set of diverse solutions to mixed integer programming problems
- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- MIP reformulations of the probabilistic set covering problem
- Optimal cutting planes from the group relaxations
- Virtual private network design over the first Chvátal closure
- Optimizing over the first Chvátal closure
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- Improved strategies for branching on general disjunctions
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
- A probabilistic analysis of the strength of the split and triangle closures
- A relax-and-cut framework for Gomory mixed-integer cuts
- MIPping closures: An instant survey
- Split cuts from sparse disjunctions
- Valid inequalities for mixed integer linear programs
- Erratum to: MIR closures of polyhedral sets
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter
- Disjunctive Cuts for Nonconvex MINLP
- On optimizing over lift-and-project closures
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
- Bilevel programming and the separation problem
- Local cuts for mixed-integer programming
- Lattice reformulation cuts
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Optimizing over the First Chvàtal Closure
- On the exact separation of mixed integer knapsack cuts
- Splitting closure operators
- On the separation of disjunctive cuts
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Cut generation through binarization
- On the enumerative nature of Gomory's dual cutting plane method
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
- Computational experiments with cross and crooked cross cuts
- Coordinated cutting plane generation via multi-objective separation
- Multirow Intersection Cuts Based on the Infinity Norm
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- Partial hyperplane activation for generalized intersection cuts
- On the relative strength of different generalizations of split cuts
- MIR closures of polyhedral sets
- Characterization of the split closure via geometric lifting
- A lexicographic pricer for the fractional bin packing problem
- A note on the split rank of intersection cuts
- Using symmetry to optimize over the Sherali-Adams relaxation
- Surrogate-RLT cuts for zero-one integer programs
- Relaxations of mixed integer sets from lattice-free polyhedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- A heuristic to generate rank-1 GMI cuts
- On the relative strength of split, triangle and quadrilateral cuts
- Split cuts for robust mixed-integer optimization
This page was built for publication: Optimizing over the split closure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476990)
