An L-shaped method with strengthened lift-and-project cuts
From MaRDI portal
Publication:2109005
Recommendations
- Strengthened benders cuts for stochastic integer programs with continuous recourse
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- Improving the integer L-shaped method
Cites work
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
- A multicut algorithm for two-stage stochastic linear programs
- A survey on Benders decomposition applied to fixed-charge network design problems
- Accelerating Benders decomposition with heuristic master problem solutions
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- An integrated model for logistics network design
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study
- Benders decomposition for production routing under demand uncertainty
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- Disjunctive Programming
- Dual decomposition in stochastic integer programming
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- Fenchel decomposition for stochastic mixed-integer programming
- Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs
- Improving the integer L-shaped method
- Introduction to stochastic programming.
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Modeling and optimizing of strategic and tactical production planning in the automotive industry under uncertainty
- On the separation of disjunctive cuts
- Partitioning procedures for solving mixed-variables programming problems
- Strengthened benders cuts for stochastic integer programs with continuous recourse
- The Benders decomposition algorithm: a literature review
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
This page was built for publication: An L-shaped method with strengthened lift-and-project cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109005)
