Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
From MaRDI portal
(Redirected from Publication:256646)
Recommendations
- scientific article; zbMATH DE number 1488015
- A generalized Benders decomposition approach to reactive source planning in power systems
- Long-Range Generation Planning Using Generalized Benders' Decomposition: Implementation and Experience
- Long-Range Generation Planning Using Generalized Benders' Decomposition: Implementation and Experience
- Distribution system planning through a generalized Benders decomposition approach
Cites work
- A Benders decomposition approach for the locomotive and car assignment problem
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A regularized decomposition method for minimizing a sum of polyhedral functions
- 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 improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- An integrated model for logistics network design
- Decomposition algorithms for stochastic programming on a computational grid
- Developing concurrent investment plans for power generation and transmission
- Error detecting and error correcting codes
- 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
- Speed-up Benders decomposition using maximum density cut (MDC) generation
- Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach
Cited in
(7)- Mixed-integer linear programming models and algorithms for generation and transmission expansion planning of power systems
- The Benders decomposition algorithm: a literature review
- An integrated planning model in centralized power systems
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- Derivation and generation of path-based valid inequalities for transmission expansion planning
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
This page was built for publication: Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256646)