An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation
From MaRDI portal
Publication:6163589
Cites work
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A stochastic programming approach for supply chain network design under uncertainty
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Accelerating Benders decomposition by local branching
- Accelerating Benders method using covering cut bundle generation
- An integrated model for logistics network design
- Improving Benders decomposition using a genetic algorithm
- Inexact Cuts in Benders Decomposition
- Large-scale mixed integer programming: Benders-type heuristics
- On generating maximal nondominated Benders cuts
- Optimization methods for electric utility resource planning
- Partitioning procedures for solving mixed-variables programming problems
- Practical enhancements to the Magnanti-Wong method
- Scenario construction and reduction applied to stochastic power generation expansion planning
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach
- Supply chain network design under uncertainty: a comprehensive review and future research directions
- The sample average approximation method applied to stochastic routing problems: a computational study
- The sample average approximation method for stochastic discrete optimization
This page was built for publication: An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163589)