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 note on "a superior representation method for piecewise linear functions"
Vielma, Juan Pablo; Ahmed, Shabbir; Nemhauser, George L. - In: INFORMS journal on computing : JOC 22 (2010) 3, pp. 493-497
Persistent link: https://www.econbiz.de/10008651597
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
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
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
Lifted tableaux inequalities for 0-1 mixed-integer programs : a computational study
Narisetty, Amar K.; P. Richard, Jean-Philippe; … - In: INFORMS journal on computing : JOC 23 (2011) 3, pp. 416-424
Persistent link: https://www.econbiz.de/10009296297
Cover Image
Two-stage decomposition algorithms for single product maritime inventory routing
Papageorgiou, Dimitri J.; Keha, Ahmet B.; Nemhauser, … - In: INFORMS journal on computing : JOC 26 (2014) 4, pp. 825-847
Persistent link: https://www.econbiz.de/10010477708
Cover Image
A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
Vielma, Juan Pablo; Ahmed, Shabbir; Nemhauser, George L. - In: INFORMS journal on computing : JOC 20 (2008) 3, pp. 438-450
Persistent link: https://www.econbiz.de/10003770186
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
On the practical strength of two-row tableau cuts
Dey, Santanu S.; Lodi, Andrea; Tramontani, Andrea; … - In: INFORMS journal on computing : JOC 26 (2014) 2, pp. 222-237
Persistent link: https://www.econbiz.de/10010362446