Pages that link to "Item:Q3013929"
From MaRDI portal
The following pages link to Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs (Q3013929):
Displaying 14 items.
- Achieving MILP feasibility quickly using general disjunctions (Q336442) (← links)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318) (← links)
- Cut generation through binarization (Q896284) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs (Q2097655) (← links)
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762) (← links)
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs (Q2452371) (← links)
- Disjunctive programming and the generalized Leontief input-output model (Q2483224) (← links)
- On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs (Q5106425) (← links)
- A disjunctive cutting plane procedure for general mixed-integer linear programs (Q5930736) (← links)
- Correction to: ``The ancestral Benders' cutting-plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming'' (Q6126668) (← links)
- Decomposition methods for global solution of mixed-integer linear programs (Q6490313) (← links)
- Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs (Q6551136) (← links)
