Narrow search
Showing 1 - 10 of 11
Cover Image
Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
Hewitt, Mike; Nemhauser, George L.; Savelsbergh, Martin … - In: INFORMS journal on computing : JOC 22 (2010) 2, pp. 314-325
Persistent link: https://www.econbiz.de/10003979991
Cover Image
A criterion space search algorithm for biobjective mixed integer programming : the triangle splitting method
Boland, Natashia; Charkhgard, Hadi; Savelsbergh, Martin … - In: INFORMS journal on computing : JOC 27 (2015) 4, pp. 597-618
Persistent link: https://www.econbiz.de/10011422640
Cover Image
A criterion space search algorithm for biobjective integer programming : the balanced box method
Boland, Natashia; Charkhgard, Hadi; Savelsbergh, Martin … - In: INFORMS journal on computing : JOC 27 (2015) 4, pp. 735-754
Persistent link: https://www.econbiz.de/10011422705
Cover Image
Branch-and-price guided search for integer programs with an application to the multicommodity fixed-charge network flow problem
Hewitt, Mike; Nemhauser, George L.; Savelsbergh, Martin … - In: INFORMS journal on computing : JOC 25 (2013) 2, pp. 302-316
Persistent link: https://www.econbiz.de/10009753753
Cover Image
An automated intensity-modulated radiation therapy planning system
Ahmed, Shabbir; Gozbasi, Ozan; Savelsbergh, Martin; … - In: INFORMS journal on computing : JOC 22 (2010) 4, pp. 568-583
Persistent link: https://www.econbiz.de/10008748495
Cover Image
Dynamic programming-based column generation on time-expanded networks : application to the dial-a-flight problem
Engineer, Faramroze G.; Nemhauser, George L.; … - In: INFORMS journal on computing : JOC 23 (2011) 1, pp. 105-119
Persistent link: https://www.econbiz.de/10008935633
Cover Image
Multivariable branching : a 0-1 knapsack problem case study
Yang, Yu; Boland, Natashia; Savelsbergh, Martin W. P. - In: INFORMS journal on computing : JOC 33 (2021) 4, pp. 1354-1367
Persistent link: https://www.econbiz.de/10012796862
Cover Image
Time-dependent shortest path problems with penalties and limits on waiting
He, Edward; Boland, Natashia; Nemhauser, George L.; … - In: INFORMS journal on computing : JOC 33 (2021) 3, pp. 997-1014
Persistent link: https://www.econbiz.de/10012631638
Cover Image
The fixed-charge shortest-path problem
Engineer, Faramroze G.; Nemhauser, George L.; … - In: INFORMS journal on computing : JOC 24 (2012) 4, pp. 578-596
Persistent link: https://www.econbiz.de/10010219624
Cover Image
A criterion space method for biobjective mixed integer programming : the boxed line method
Perini, Tyler; Boland, Natashia; Pecin, Diego; … - In: INFORMS journal on computing : JOC 32 (2020) 1, pp. 16-39
Persistent link: https://www.econbiz.de/10012182972