Towards stochastic constraint programming: A study of onine multi-choice knapsack with deadlines

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

Volumn 2239, Issue , 2001, Pages 61-76

  Benoist, Thierry ^a   Bourreau, Eric ^a   Caseau, Yves ^a   Rottembourg, Benoît ^a  

^a Bouygues Telecom   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPTIMIZATION; STOCHASTIC SYSTEMS;

COMBINATORIAL ASPECT; CONSTRAINT PROGRAMMING; DETERMINISTIC ALGORITHMS; DYNAMIC STRATEGIES; GENERAL PROGRAMMING; INDUSTRIAL EXPERIENCE; STOCHASTIC CONSTRAINTS; STOCHASTIC OPTIMIZATION APPROACH;

PROBLEM SOLVING;

EID: 84947942698     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45578-7_5     Document Type: Article

References (24)

1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko: Approximation schemes for minimizing average weighted completion time with release dates. Proc. of the 1999 Symposium on Foundations of Computer Science (FOCS99), 1999.
2. [AW96] A.N. Avramidis, J. R. Wilson: Integrated variance reduction strategies for simulation. Operations Research 44 (2): 327-346, 1996.
3. [B57] R. Bellman. Dynamic Programming. Princeton University Press, 1957.
4. [BC89] D. P. Bertsekas, D.A. Castanon. Adaptative aggregation for infinite horizon dynamic programming. IEEE Transactions on Automatic Control, 34(6):589-598, 1989.
5. [BDG95] C. Boutilier, R. Dearden, M. Goldszmidt: Exploiting structure in policy construction. In Proceedings of the 1995 international joint conference on artificial intelligence, 1995.
6. J. Birge, F. Louveaux,: Introduction to Stochastic Programming Springer Series in Operations Research, 1997.
7. [BT96] D. P. Bertsekas, J. N. Tsitsiklis: Neuro-dynamic Programming. Athena, Belmont, MA, 1996.
8. [CSL99] Y. Caseau, G. Silverstein, F. Laburthe, A Meta-Heuristic Factory for Vehicle Routing Problems, Proc. of the 5th Int. Conference on Principles and Practice of Constraint Programming CP’99, LNCS 1713, Springer, 1999.
9. [D63] F. D’Epenoux. A probabilistic production and inventory problem. Management Science: 10:98-108, 1963.
10. [DL95] T. Dean, S. H. Lin. Decomposition techniques for planning in stochastic domains, In Proceedings of the 1995 international joint conference on artificial intelligence, 1995.
11. [DW00] A. Di Pierro, H. Wiklicky: Randomised Algorithms and Probabilistic Constraint Programming Proc. of the ERCIM/Compulog Workshop on Constraints, 19-21 June, Padova, Italy, 2000.
12. [FW97] A. Fiat, G.J. Woeginger: Online Algorithms Lecture Notes in Computer Science, vol. 1442.
13. J.I. McGuill, G.J. Van Ryzin Revenue Management: research overview and prospects Transportation science vol.33 n°2, may 99.
14. [H60] R.A. Howard: Dynamic programming and markov Chains. MIT Press. Cambridge, 1960.
15. [HG95] W. Harvey, M. Ginsberg: Limited Discrepancy Search. Proceedings of the 14th IJCAI, p. 607-615, Morgan Kaufmann, 1995.
16. L. Hall, A. S. Schulz, D. Shmoys, J. Wein: Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms. Proc of SODA: ACM-SIAM Symposium on Discrete Algorithms, 1996.
17. [KC74] H. J. Kushner, C. H. Chen: Decomposition of systems governed by Markov chains. IEEE transactions on Automatic Control, AC-19(5):501-507, 1974.
18. N. Meuleau, M. Hauskrecht, K.-E. Kim, L. Peshkin, L.P. Kaelbling, T. dean, C. Boutilier. Solving Very Large Weakly Coupled Markov Decision Processes. American Association for Artificial Intelligence, 1998.
19. [MT90] S. Martello, P. Toth, Knapsack problems. Algorithms and computer implementations. John Wiley and Sons, West Sussex, England, 1990.
20. [P98] R. Parr. Flexible Decompostion Algorithms for weakly coupled Markov Decision Problems. Uncertainty in Artificial Intelligence. Madison, Wisconsin, USA, 1998
21. [P94] M. L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York, 1994.
22. [PRK95] J. Papastavrou, S. Rajagopalan, A. Kleywegt: The Dynamic and Stochastic Knapsack Problem with Deadlines. Technical report, School of Industrial Engineering, Purdue University, West Lafayette, April 1995.
23. [SC98] S. P. Singh, D. Cohn. How to dynamically merge Markov Decision Processes. In M. Mozer, M. Jordan and T. Petsche eds, NIPS-11. MIT Press, Cambridge, 1998.
24. [WB92] L.R. Weatherford, S.E. Bodily: A Taxonomy and Research Overview of Perishable- Asset Revenue Managment: Yield Managment, Overbooking and Pricing. Operations Research 40:831-844, 1992