In this paper, we tackle the hydro unit commitment problem and scheduling in a hydro valley. We first decompose the problem into several simpler subproblems, one for each reservoir/plant. Then, we model each of them as an optimization problem on graphs with or without resource constraints. We compare our method with a commercial solver for mixed integer linear programming, run on a formulation of the problem and show promising results.

中文翻译：

---

解决流域水电承诺和调度的分解和最短路径问题公式

在本文中，我们解决了流域的水电机组承诺问题和调度问题。我们首先将问题分解为几个简单的子问题，每个子库/工厂一个。然后，我们将每个模型都建模为有或没有资源约束的图上的优化问题。我们将我们的方法与用于混合整数线性规划的商用求解器进行了比较，对问题进行了阐述，并显示出令人鼓舞的结果。