The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs
From MaRDI portal
Publication:6112748
DOI10.1016/j.ejor.2023.01.004MaRDI QIDQ6112748
François Clautiaux, Boris Detienne, Xavier Blanchot, Manuel Ruiz Marin, Aurélien Froger
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study
- Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
- Practical enhancements to the Magnanti-Wong method
- A multicut algorithm for two-stage stochastic linear programs
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Decomposition methods in stochastic programming
- Introductory lectures on convex optimization. A basic course.
- Decomposition algorithms for stochastic programming on a computational grid
- New variants of bundle methods
- Two-stage linear decision rules for multi-stage stochastic programming
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- On generating maximal nondominated Benders cuts
- Multicut Benders decomposition algorithm for process supply chain planning under uncertainty
- The empirical behavior of sampling methods for stochastic programming
- Level bundle methods for oracles with on-demand accuracy
- Inexact Bundle Methods for Two-Stage Stochastic Programming
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- An In-Out Approach to Disjunctive Optimization
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
- Implementing Automatic Benders Decomposition in a Modern MIP Solver
- Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse
- Implementing Mixed Integer Column Generation
- An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse
- Some methods of speeding up the convergence of iteration methods
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Benchmarking optimization software with performance profiles.
- A comprehensive input format for stochastic linear programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item