Narrow search
Showing 1 - 6 of 6
Cover Image
The value function of an infinite-horizon single-item lot-sizing problem
Toriello, Alejandro; Nemhauser, George L. - In: Operations research letters 40 (2012) 1, pp. 12-14
Persistent link: https://www.econbiz.de/10009503776
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
Optimization
Nemhauser, George L. (contributor);  … - 1989
Persistent link: https://www.econbiz.de/10011519338
Cover Image
Approximate dynamic programming for a class of long-horizon maritime inventory routing problems
Papageorgiou, Dimitri J.; Cheon, Myun-Seok; Nemhauser, … - In: Transportation science : a journal of the Institute for … 49 (2015) 4, pp. 870-885
Persistent link: https://www.econbiz.de/10011397894
Cover Image
State-variable modeling for a class of two-stage stochastic optimization problems
Doulabi, Hossein Hashemi; Ahmed, Shabbir; Nemhauser, … - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 1, pp. 354-369
Persistent link: https://www.econbiz.de/10013359075
Cover Image
Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
Queyranne, Maurice; Wolsey, Laurence A. - 2016
Persistent link: https://www.econbiz.de/10011749290