Performance analysis of online anticipatory algorithms for large multistage stochastic integer programs

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 1979-1984

  Mercier, Luc ^a   Van Hentenryck, Pascal ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPECTED UTILITY; INTEGER PROGRAM; OPTIMAL POLICIES; PERFORMANCE ANALYSIS; POLYNOMIAL NUMBER; SAMPLING ERRORS; STOCHASTIC COMBINATORIAL OPTIMIZATION; SUFFICIENT CONDITIONS;

ARTIFICIAL INTELLIGENCE; ERRORS; INTEGER PROGRAMMING; STOCHASTIC SYSTEMS;

ALGORITHMS;

EID: 84880899936     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. A.G. Barto, S.J. Bradtke, and S.P. Singh. Learning to act using real-time dynamic programming. Artificial Intelligence, 72(1):81-138, 1995.
2. T. Benoist, E. Bourreau, Y. Caseau, and B. Rottembourg. Towards stochastic constraint programming: A study of online multi-choice knapsack with deadlines. In CP'01, 2001.
3. R. Bent and P. Van Hentenryck. Dynamic Vehicle Routing with Stochastic requests. IJCAI' 03.
4. R. Bent and P. Van Hentenryck. Regrets only! online stochastic optimization under time constraints. In AAAI'04, 2004.
5. R. Bent, I. Katriel, and P. Van Hentenryck. Sub-Optimality Approximation. In CP'05, 2005.
6. J.R. Birge and F. Louveaux. Introduction to Stochastic Programming. Springer Verlag.
7. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
8. H. Chang, R. Givan, and E. Chong. Online Scheduling Via Sampling. Artificial Intelligence Planning and Scheduling (AIPS'00), pages 62-71, 2000.
9. M. A. H. Dempster. Sequential importance sampling algorithms for dynamic stochastic programming. Annals of Operations Research, 84:153-184, 1998.
10. P. Van Hentenryck, R. Bent, and Y. Vergados. Online stochastic reservation systems. In CPAIOR'06, Springer, 2006.
11. M. Kearns, Y. Mansour, and A. Ng. A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes. In IJCAI'99, 1999.
12. S. Paquet, L. Tobin, and B. Chaib-draa. Real-Time Decision Making for Large POMDPs. In 18th Canadian Conference on Artificial Intelligence, 2005.
13. A. Shapiro. On complexity of multistage stochastic programs. Oper. Res. Lett, 34(1):1-8, 2006. (Pubitemid 41688309)