A disjunctive cutting plane procedure for general mixed-integer linear programs
From MaRDI portal
A cutting plane algorithm for mixed integer programs with general integer variables is developed. It is based on variable disjunctions. The authors prove that the procedure finitely generates the convex hull for any variable \(x_j \in \mathbb Z\) and conv\((F)\) in the limit. The cutting plane algorithm generates cutting planes at the optimal and near optimal vertices. The work extends earlier research on integer programmes with binary variables.
Recommendations
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- A simple finite cutting plane algorithm for integer programs
- Cutting planes for integer programs with general integer variables
- Chvátal closures for mixed integer programming problems
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
Cited in
(36)- Cutting plane algorithms for the inverse mixed integer linear programming problem
- A finitely converging cutting plane technique
- Cutting planes for integer programs with general integer variables
- Binary extended formulations of polyhedral mixed-integer sets
- Theoretical challenges towards cutting-plane selection
- On the relative strength of different generalizations of split cuts
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- A simple finite cutting plane algorithm for integer programs
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs
- On the facet defining inequalities of the mixed-integer bilinear covering set
- Further results on an abstract model for branching and its application to mixed integer programming
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization
- Disjunctive Cuts for Nonconvex MINLP
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- Achieving MILP feasibility quickly using general disjunctions
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- A finite cutting plane method for facial disjunctive programs
- scientific article; zbMATH DE number 404436 (Why is no real title available?)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
- Intersection cuts from multiple rows: a disjunctive programming approach
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- Relaxations of mixed integer sets from lattice-free polyhedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- An interior point cutting plane heuristic for mixed integer programming
- A disjunctive cutting plane algorithm for bilinear programming
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Cutting planes in integer and mixed integer programming
- On convergence in mixed integer programming
- Testing cut generators for mixed-integer linear programming
- Depth-optimized convexity cuts
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- Cook, Kannan and Schrijver's example revisited
This page was built for publication: A disjunctive cutting plane procedure for general mixed-integer linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5930736)
