Narrow search
Showing 1 - 10 of 2,587
Cover Image
Online allocation and pricing : constant regret via Bellman inequalities
Vera, Alberto; Banerjee, Siddartha; Gurvich, Itai - In: Operations research 69 (2021) 3, pp. 821-840
Persistent link: https://www.econbiz.de/10012546874
Cover Image
Approximate dynamic programming for an energy-efficient parallel machine scheduling problem
Heydar, Mojtaba; Mardaneh, Elham; Loxton, Ryan - In: European journal of operational research : EJOR 302 (2022) 1, pp. 363-380
Persistent link: https://www.econbiz.de/10013269762
Cover Image
Surgical scheduling under uncertainty by approximate dynamic programming
Silva, Thiago A. O.; Souza, Maurício C. de - In: Omega : the international journal of management science 95 (2020), pp. 1-15
Persistent link: https://www.econbiz.de/10012243870
Cover Image
Least squares policy iteration with instrumental variables vs. direct policy search : comparison against optimal benchmarks using energy storage
Moazeni, Somayeh; Scott, Warren R.; Powell, Warren B. - In: INFOR : information systems and operational research 58 (2020) 1, pp. 141-166
Persistent link: https://www.econbiz.de/10012204237
Cover Image
A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
Goodson, Justin C.; Thomas, Barrett W.; Ohlmann, Jeffrey W. - In: European journal of operational research : EJOR 258 (2017) 1, pp. 216-229
Persistent link: https://www.econbiz.de/10011641521
Cover Image
Adaptive stochastic lookahead policies for dynamic multi-period purchasing and inventory routing
Cuellar-Usaquén, Daniel; Ulmer, Martin W.; Gomez, Camillo - 2023
problem is a stochastic dynamic multi-period routing problem with inventory and purchasing decisions. The decision space of … iteratively via repeated simulation and adaption of the lookahead. We show that our method outperforms a large number of benchmark …
Persistent link: https://www.econbiz.de/10014282392
Cover Image
Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing
Ulmer, Marlin Wolf - In: Central European journal of operations research 28 (2020) 1, pp. 279-308
Persistent link: https://www.econbiz.de/10012221871
Cover Image
A multiphase dynamic programming algorithm for the shortest path problem with resource constraints
Himmich, Ilyas; El Hallaoui, Issmail; Soumis, François - In: European journal of operational research : EJOR 315 (2024) 2, pp. 470-483
Persistent link: https://www.econbiz.de/10014565001
Cover Image
Energy-saving time allocation strategy with uncertain dwell times in urban rail transit : Two-stage stochastic model and nested dynamic programming framework
Lian, Deheng; Mo, Pengli; D'Ariano, Andrea; Gao, Ziyou; … - In: European journal of operational research : EJOR 317 (2024) 1, pp. 219-242
Persistent link: https://www.econbiz.de/10014634781
Cover Image
Comparison of anticipatory algorithms for a dial-a-ride problem
Ritzinger, Ulrike; Puchinger, Jakob; Rudloff, Christian; … - In: European journal of operational research : EJOR 301 (2022) 2, pp. 591-608
Persistent link: https://www.econbiz.de/10013207664