An L-shaped method with strengthened lift-and-project cuts
From MaRDI portal
Publication:2109005
DOI10.1007/s10287-022-00426-yOpenAlexW4229020951MaRDI QIDQ2109005
Pavlo Glushko, Csaba I. Fábián, Achim 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- On the separation of disjunctive cuts
- An integrated model for logistics network design
- Modeling and optimizing of strategic and tactical production planning in the automotive industry under uncertainty
- A multicut algorithm for two-stage stochastic linear programs
- Partitioning procedures for solving mixed-variables programming problems
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- Dual decomposition in stochastic integer programming
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
- Lift-and-project cuts for convex mixed integer nonlinear programs
- The Benders decomposition algorithm: a literature review
- A survey on Benders decomposition applied to fixed-charge network design problems
- Fenchel decomposition for stochastic mixed-integer programming
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- 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
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Improving the Integer L-Shaped Method
- Introduction to Stochastic Programming
- Benders Decomposition for Production Routing Under Demand Uncertainty
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Disjunctive Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Accelerating benders decomposition with heuristicmaster problem solutions
- Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
