An L-shaped method with strengthened lift-and-project cuts
From MaRDI portal
Publication:2109005
DOI10.1007/S10287-022-00426-YOpenAlexW4229020951MaRDI QIDQ2109005FDOQ2109005
Authors: Pavlo Glushko, Csaba I. Fábián, A. Koberstein 
Publication date: 20 December 2022
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-022-00426-y
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
- Partitioning procedures for solving mixed-variables programming problems
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Title not available (Why is that?)
- An integrated model for logistics network design
- A multicut algorithm for two-stage stochastic linear programs
- Dual decomposition in stochastic integer programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Introduction to stochastic programming.
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Disjunctive Programming
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study
- A survey on Benders decomposition applied to fixed-charge network design problems
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- Title not available (Why is that?)
- Fenchel decomposition for stochastic mixed-integer programming
- Benders decomposition for production routing under demand uncertainty
- On the separation of disjunctive cuts
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs
- Strengthened benders cuts for stochastic integer programs with continuous recourse
- Lift-and-project cuts for convex mixed integer nonlinear programs
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- The Benders decomposition algorithm: a literature review
- Modeling and optimizing of strategic and tactical production planning in the automotive industry under uncertainty
- Accelerating Benders decomposition with heuristic master problem solutions
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
- Improving the integer L-shaped method
Cited In (1)
Uses Software
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)
