Solving the conic formulation of the security-constrained unit commitment problem via decomposition
EURO Journal on Computational Optimization · 2026 · 14 · 100136
DOI: 10.1016/j.ejco.2026.100136 ↗Kurz gefasst
Fachartikel in der Zeitschrift EURO Journal on Computational Optimization, 2026. Verfasst von Yongzheng Dai und 1 weiteren Autor:innen. Die Arbeit nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Dai, Y., & Conejo, A. J. (2026). Solving the conic formulation of the security-constrained unit commitment problem via decomposition. EURO Journal on Computational Optimization, 14, 100136. https://doi.org/10.1016/j.ejco.2026.100136
Vancouver
Dai Y, Conejo AJ. Solving the conic formulation of the security-constrained unit commitment problem via decomposition. EURO Journal on Computational Optimization. 2026;14:100136. doi:10.1016/j.ejco.2026.100136
BibTeX
@article{Dai2026,
author = {Dai, Yongzheng and Conejo, Antonio J.},
title = {Solving the conic formulation of the security-constrained unit commitment problem via decomposition},
journal = {EURO Journal on Computational Optimization},
year = {2026},
volume = {14},
pages = {100136},
doi = {10.1016/j.ejco.2026.100136}
}
EUVIMED