High-Performance Prototyping of Decomposition Methods in GAMS
From MaRDI portal
Publication:4995054
DOI10.1287/ijoc.2019.0905OpenAlexW3034433955MaRDI QIDQ4995054
Steffen Rebennack, Michael R. Bussieck, Timo Lohmann, Lutz Westermann
Publication date: 23 June 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2019.0905
parallel computingdata structuresBenders decompositionalgebraic modeling languagesexpansion planningGAMS
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
- Spatio-temporal hydro forecasting of multireservoir inflows for hydro-thermal scheduling
- Polylithic modeling and solution approaches using algebraic modeling systems
- Partitioning procedures for solving mixed-variables programming problems
- Multi-stage stochastic optimization applied to energy planning
- Modeling languages in mathematical optimization.
- Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem
- A polyhedral branch-and-cut approach to global optimization
- Grid-Enabled Optimization with GAMS
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition
- Generation Capacity Expansion in Imperfectly Competitive Restructured Electricity Markets
- Long-Range Generation Planning Using Generalized Benders' Decomposition: Implementation and Experience
This page was built for publication: High-Performance Prototyping of Decomposition Methods in GAMS