The Dynamic and Stochastic Knapsack Problem with Random Sized Items

References

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