Online stochastic reservation systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3990 LNCS, Issue , 2006, Pages 212-227

  Van Hentenryck, Pascal ^a   Bent, Russell ^a   Vergados, Yannis ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DYNAMIC PROGRAMMING; MATHEMATICAL PROGRAMMING; ONLINE SYSTEMS; OPTIMIZATION; RESOURCE ALLOCATION;

MULTI-KNAPSACK PROBLEM; ONLINE STOCHASTIC RESERVATION SYSTEM; OPTIMAL APPROXIMATION; OVERBOOK;

STOCHASTIC PROGRAMMING;

EID: 33746057422     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11757375_18     Document Type: Conference Paper

References (13)

1. T. Benoist, E. Bourreau, Y. Caseau, and B. Rottembourg. Towards stochastic constraint programming: A study of online multi-choice knapsack with deadlines. In Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming (CP'01), pages 61-76, London, UK, 2001. Springer-Verlag.
2. R. Bent, I. Katriel, and P. Van Hentenryck. Sub-Optimality Approximation. In Eleventh International Conference on Principles and Practice of Constraint Programming, Stiges, Spain, 2005.
3. R. Bent and P. Van Hentenryck. A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows. Transportation Science, 8(4):515-530, 2004.
4. R. Bent and P. Van Hentenryck. Online Stochastic and Robust Optimization. In Proceeding of the 9th Asian Computing Science Conference (ASIAN'04), Chiang Mai University, Thailand, December 2004.
5. R. Bent and P. Van Hentenryck. Regrets Only. Online Stochastic Optimization under Time Constraints. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI'04), San Jose, CA, July 2004.
6. R. Bent and P. Van Hentenryck. Scenario Based Planning for Partially Dynamic Vehicle Routing Problems with Stochastic Customers. Operations Research, 52(6), 2004.
7. R. Bent and P. Van Hentenryck. The Value of Consensus in Online Stochastic Scheduling. In Proceedings of the 14th International Conference on Automated Planning & Scheduling (ICAPS 2004), Whistler, British Columbia, Canada, 2004.
8. R. Bent and P. Van Hentenryck. Online Stochastic Optimization without Distributions In Proceedings of the 15th International Conference on Automated Planning & Scheduling (ICAPS 2005), Monterey, CA, 2005.
9. A. Campbell and M. Savelsbergh. Decision Support for Consumer Direct Grocery Initiatives. Report TLI-02-09, Georgia Institute of Technology, 2002.
10. H. Chang, R. Givan, and E. Chong. On-line Scheduling Via Sampling. Artificial Intelligence Planning and Scheduling (AIPS'00), pages 62-71, 2000.
11. B. Dean, M.X. Goemans, and J. Vondrak. Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pages 208-217, Rome, Italy, 2004.
12. M. Puterman. Markov Decision Processes. John Wiley & Sons, New York, 1994.
13. P. Shaw. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In Proceedings of Fourth International Conference on the Principles and Practice of Constraint Programming (CP '98), pages 417-431, Pisa, October 1998.