Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
Year of publication: |
March 2017
|
---|---|
Authors: | Dupin, Nicolas |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 5.2017, 1/2, p. 149-176
|
Subject: | OR in energy | Unit commitment problem | Ramping constraints | Mixed integer programming | Polyhedron | Constraint reformulation | Ganzzahlige Optimierung | Integer programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Bacci, Tiziano, (2024)
-
An efficient two-stage algorithm for decentralized scheduling of micro-CHP units
Jochem, Patrick, (2015)
-
Decision support system of truck routing and refueling : a dual-objective approach
Suzuki, Yoshinori, (2013)
- More ...
-
Parallel matheuristics for the discrete unit commitment problem with min-stop ramping constraints
Dupin, Nicolas, (2018)
-
A deterministic annealing local search for the electric autonomous dial-a-ride problem
Su, Yue, (2023)
-
A novel solution approach with ML-based pseudo-cuts for the Flight and Maintenance Planning problem
Peschiera, Franco, (2021)
- More ...