Narrow search
Showing 1 - 6 of 6
Cover Image
Nonconvex robust optimization for problems with constraints
Bertsimas, Dimitris; Nohadani, Omid; Teo, Kwong Meng - In: INFORMS journal on computing : JOC 22 (2010) 1, pp. 44-58
Persistent link: https://www.econbiz.de/10003962680
Cover Image
Duality in two-stage adaptive linear optimization : faster computation and stronger bounds
Bertsimas, Dimitris; Ruiter, Frans de - In: INFORMS journal on computing : JOC 28 (2016) 3, pp. 500-511
Persistent link: https://www.econbiz.de/10011538998
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
Cover Image
The recoverable robust two-level network design problem
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Raghavan, S.; … - In: INFORMS journal on computing : JOC 27 (2015) 1, pp. 1-19
Persistent link: https://www.econbiz.de/10010505114
Cover Image
Relative robust and adaptive optimization
Bertsimas, Dimitris; Dunning, Iain - In: INFORMS journal on computing : JOC 32 (2020) 2, pp. 408-427
Persistent link: https://www.econbiz.de/10012242771
Cover Image
A dual ascent-based branch-and-bound framework for the prize-collecting steiner tree and related problems
Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; … - In: INFORMS journal on computing : JOC 30 (2018) 2, pp. 402-420
Persistent link: https://www.econbiz.de/10011878363