The dynamic and stochastic knapsack problem with random sized items

Operations Research

Volumn 49, Issue 1, 2001, Pages 26-41

  Kleywegt, Anton J ^a   Papastavrou, Jason D ^b  

^a Georgia Institute of Technology   (United States)

^b SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INVESTMENTS; PUBLIC POLICY; RANDOM PROCESSES; RESOURCE ALLOCATION; SCHEDULING;

RESOURCE ALLOCATION PROBLEMS;

PROBLEM SOLVING;

EID: 0035008943     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.49.1.26.11185     Document Type: Article

References (26)

1. Albright, S. C. 1977. A Bayesian approach to a general house selling problem. Management Sci. 24 432-440.
2. Belobaba, P. P. 1989. Application of a probabilistic decision model to airline seat inventory control. Oper. Res. 37 183-197.
3. Blackwell, D. 1965. Discounted dynamic programming. Ann. Math. Statist. 36 226-235.
4. Boel, K., P. Varaiya. 1977. Optimal control of jump processes. SIAM J. Control Optimiz. 15 92-119.
5. Brumelle, S. L., J. I. McGill. 1993. Airline seat allocation with multiple nested fare classes. Oper. Res. 41 127-137.
6. Carraway, R. L., R. L. Schmidt, L. R. Weatherford. 1993. An algorithm for maximizing target achivement in the stochastic knapsack problem with normal returns. Naval Res. Logist. Quart. 40 161-173.
7. Derman, C., G. J. Lieberman, S. M. Ross. 1972. A sequential stochastic assignment problem. Management Sci. 18 349-355.
8. Freeman, P. R. 1983. The secretary problem and its extensions: a review. Int. Statist. Rev. 51 189-206.
9. Gallego, G., G. Van Ryzin. 1994. Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci. 40 999-1020.
10. Kincaid, W. M., D. A. Darling. 1963. An inventory pricing problem. J. Math. Anal. Appl. 7 183-208.
11. Kleywegt, A. J. 1996. Dynamic and Stochastic Models with Freight Distribution Applications. Ph.D. Thesis, School of Industrial Engineering, Purdue University.
12. _, J. D. Papastavrou. 1998. The dynamic and stochastic knapsack problem. Oper. Res. 46 17-35.
13. Mamer, J. W. 1986. Successive approximations for finite horizon, semi-Markov decision processes with application to asset liquidation. Oper. Res. 34 638-644.
14. Martello, S., P. Toth. 1990. Knapsack Problems. Algorithms and Computer Implementations. John Wiley & Sons, West Sussex, England.
15. Papastavrou, J. D., S. Rajagopalan, A. J. Kleywegt. 1996. A stochastic model for the knapsack problem with a deadline. Management Sci. 42 1706-1718.
16. Prastacos, G. P. 1983. Optimal sequential investment decisions under conditions of uncertainty. Management Sci. 29 118-134.
17. Presman, E. L., I. M. Sonin. 1972. The best choice problem for a random number of objects. Theory Probab. Its Appl. 17 657-668.
18. Rockafellar, R. T. 1970. Convex Analysis. Princeton University Press, Princeton, NJ.
19. Rosenfield, D. B., R. D. Shapiro, D. A. Butler. 1983. Optimal strategies for selling an asset. Management Sci. 29 1051-1061.
20. Ross, K. W., D. H. K. Tsang. 1989. The stochastic knapsack problem. IEEE Trans. Comm. 37 740-747.
21. Royden, H. L. 1988. Real Analysis. Macmillan, New York.
22. Sniedovich, M. 1980. Preference order stochastic knapsack problems: methodological issues. J. Oper. Res. Soc. 31 1025-1032.
23. Stadje, W. 1990. A full information pricing problem for the sale of several identical commodities. Zeitschrift für Oper. Res. 34 161-181.
24. Stewart, T. J. 1981. The secretary problem with an unknown number of options. Oper. Res. 29 130-145.
25. Weatherford, L. R., S. E. Bodily. 1992. A taxonomy and research overview of perishable-asset revenue management: yield management, overbooking, and pricing. Oper. Res. 40 831-844.
26. Yushkevich, A. A., E. A. Feinberg. 1979. On homogeneous Markov models with continuous time and finite or countable state space. Theory Probab. Its Appl. 24 156-161.