A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems
Authors:
- Dimitris BertsimasDBDimitris Bertsimas
- J. Daniel GriffithJGJ. Daniel Griffith
- Vishal GuptaVGVishal Gupta
- Mykel J. KochenderferMKMykel J. Kochenderfer
- Velibor V. MišićVMVelibor V. Mišić
- 1 December 2017
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 263 (2) , 664-678
Abstract
No abstract availableAll Related Versions
This publication has 25 references indexed in Scilit:
- A Simulation and Stochastic Integer Programming Approach to Wildfire Initial Attack PlanningForest Science, 2013
- Monte-Carlo tree search and rapid action value estimation in computer GoArtificial Intelligence, 2011
- Computer poker: A reviewArtificial Intelligence, 2011
- Monte Carlo tree search in KriegspielArtificial Intelligence, 2010
- Integrated simulation and optimization for wildfire containmentACM Transactions on Modeling and Computer Simulation, 2009
- Analysing initial attack on wildland fires using stochastic simulation*International Journal of Wildland Fire, 2006
- Dynamic Scheduling with Convex Delay Costs: The Generalized $c|mu$ RuleThe Annals of Applied Probability, 1995
- On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit ModelsThe Annals of Applied Probability, 1995
- Optimization of Multiclass Queueing Networks: Polyhedral and Nonlinear Characterizations of Achievable PerformanceThe Annals of Applied Probability, 1994
- The cμ rule revisitedAdvances in Applied Probability, 1985