Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
From MaRDI portal
Recommendations
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- Disjunctive cuts for mixed integer nonlinear programming problems
- Mixed-integer linear representability, disjunctions, and variable elimination
- A hierarchy of relaxations for linear generalized disjunctive programming
- Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs
- Discretization and global optimization for mixed integer bilinear programming
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- A constructive characterization of the split closure of a mixed integer linear program
- Representability in mixed integer programming. I: Characterization results
Cited in
(15)- Correction to: ``The ancestral Benders' cutting-plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs
- On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- Theoretical challenges towards cutting-plane selection
- Achieving MILP feasibility quickly using general disjunctions
- Disjunctive programming and the generalized Leontief input-output model
- Cut generation through binarization
- \(\mathcal{V}\)-polyhedral disjunctive cuts
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- Decomposition methods for global solution of mixed-integer linear programs
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs
This page was built for publication: Finite Disjunctive Programming Characterizations 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 Q3013929)
