Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley

DOI10.1016/j.ejor.2020.12.029zbMath1487.90668OpenAlexW3116037769MaRDI QIDQ2030657

Claudia D'Ambrosio, Renan Spencer Trindade, Dimitri Thomopulos, Wim van Ackooij

Publication date: 7 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.12.029

zbMATH Keywords

decompositioncombinatorial optimizationbundle methodhydro unit commitmentshortest path problem variants

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items (1)

Introduction to special issue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A doubly stabilized bundle method for nonsmooth convex optimization
• Convex proximal bundle methods in depth: a unified analysis for inexact oracles
• Solving the unit commitment problem of hydropower plants via Lagrangian relaxation and sequential quadratic programming
• Divide to conquer: decomposition methods for energy optimization
• About Lagrangian methods in integer optimization
• The ABC of DC programming
• Large-scale unit commitment under uncertainty: an updated literature survey
• Large-scale unit commitment under uncertainty
• On a primal-proximal heuristic in discrete optimization
• A primal-proximal heuristic applied to the French unit-commitment problem
• Incremental Bundle Methods using Upper Models

This page was built for publication: Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley