Narrow search
Showing 1 - 10 of 22
Cover Image
On mixed-integer programming formulations for the unit commitment problem
Knueven, Bernard; Ostrowski, James; Watson, Jean-Paul - In: INFORMS journal on computing : JOC 32 (2020) 4, pp. 857-876
Persistent link: https://www.econbiz.de/10012390168
Cover Image
The ramping polytope and cut generation for the unit commitment problem
Knueven, Ben; Ostrowski, Jim; Wang, Jianhui - In: INFORMS journal on computing : JOC 30 (2018) 4, pp. 739-749
Persistent link: https://www.econbiz.de/10011966561
Cover Image
Algorithm for the N-2 security-constrained unit commitment problem with transmission switching
Schumacher, Kathryn M.; Cohn, Amy E. M.; Chen, Richard … - In: INFORMS journal on computing : JOC 29 (2017) 4, pp. 645-659
Persistent link: https://www.econbiz.de/10011772418
Cover Image
Extreme ray feasibility cuts for unit commitment with uncertainty
Li, Chao; Zhang, Muhong; Hedman, Kory - In: INFORMS journal on computing : JOC 33 (2021) 3, pp. 1037-1055
Persistent link: https://www.econbiz.de/10012631646
Cover Image
Approximating the split closure
Fischetti, Matteo; Salvagnin, Domenico - In: INFORMS journal on computing : JOC 25 (2013) 4, pp. 808-819
Persistent link: https://www.econbiz.de/10010203571
Cover Image
Backdoor branching
Fischetti, Matteo; Monaci, Michele - In: INFORMS journal on computing : JOC 25 (2013) 4, pp. 693-700
Persistent link: https://www.econbiz.de/10010203613
Cover Image
Enhanced models for a mixed arrival-departure aircraft sequencing problem
Ghoniem, Ahmed; Sherali, Hanif D.; Baik, Hojong - In: INFORMS journal on computing : JOC 26 (2014) 3, pp. 514-530
Persistent link: https://www.econbiz.de/10010399748
Cover Image
An integer-programming-based approach to the close-enough traveling salesman problem
Behdani, Behnam; Smith, J. Cole - In: INFORMS journal on computing : JOC 26 (2014) 3, pp. 415-432
Persistent link: https://www.econbiz.de/10010399822
Cover Image
Mathematical programming formulations and algorithms for discrete k-median clustering of time-series data
Seref, Onur; Fan, Ya-ju; Chaovalitwongse, Wanpracha - In: INFORMS journal on computing : JOC 26 (2014) 1, pp. 160-172
Persistent link: https://www.econbiz.de/10010344112
Cover Image
A computational study of exact approaches for the bi-objective prize-collecting steiner tree problem
Leitner, Markus; Ljubić, Ivana; Sinnl, Markus - In: INFORMS journal on computing : JOC 27 (2015) 1, pp. 118-134
Persistent link: https://www.econbiz.de/10010505040