Narrow search
Showing 11 - 20 of 247
Cover Image
Large neighborhood search for LNG inventory routing
Goel, Vikas; Furman, Kevin C.; Song, Jin-Hwa; El-Bakry, … - In: Journal of heuristics 18 (2012) 6, pp. 821-848
Persistent link: https://www.econbiz.de/10010056375
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
Tactical and operational planning of scheduled maintenance for per-seat, on-demand air transportation
Keysan, Gizem; Nemhauser, George L.; Savelsbergh, … - In: Transportation science : a journal of the Institute for … 44 (2010) 3, pp. 291-306
Persistent link: https://www.econbiz.de/10008649345
Cover Image
Pricing for production and delivery flexibility in single-item lot-sizing
Li, Yaxian; Nemhauser, George L.; Savelsbergh, Martin W. P. - In: Computers & operations research : and their … 39 (2012) 12, pp. 3408-3419
Persistent link: https://www.econbiz.de/10009577160
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
Restrict-and-relax search for 0-1 mixed-integer programs
Guzelsoy, Menal; Nemhauser, George L.; Savelsbergh, … - In: EURO journal on computational optimization 1 (2013) 1/2, pp. 201-218
Persistent link: https://www.econbiz.de/10010401841
Cover Image
A multi-item production planning model with setup times : algorithms, reformulations, and polyhedral characterizations for a special case
Miller, Andrew J.; Nemhauser, George L.; Savelsbergh, … - 2001
Persistent link: https://www.econbiz.de/10001573365
Cover Image
On the polyhedral structure of a multi-item production planning model with setup times
Miller, Andrew J.; Nemhauser, George L.; Savelsbergh, … - 2000
Persistent link: https://www.econbiz.de/10001555027
Cover Image
Solving multi-item capacitated lot-sizing problems with setup times by branch-and-cut
Miller, Andrew J.; Nemhauser, George L.; Savelsbergh, … - 2000
Persistent link: https://www.econbiz.de/10001529861
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