On Optimal Allocation of Indivisibles Under Uncertainty

Published Online:https://doi.org/10.1287/opre.46.3.381

References

  • Andradottir S. A global search method for discrete stochastic optimization. SIAM J. Optim. (1996) 513–530Google Scholar
  • Dantzig G. B., Glynn P. W. Parallel processors for planning under uncertainty. Ann. O. R. (1990) 22:1–21CrossrefGoogle Scholar
  • Dupač V., Herkenrath U. Stochastic approximation on a discrete set and the multi-armed bandit problem. Commun. Statist.-Sequential Anal. (1982) 1:1–25CrossrefGoogle Scholar
  • Ermoliev Yu. M.Methods of Stochastic Programming (1976) (Nauka, Moscow. (In Russian)) Google Scholar
  • Ermoliev Yu. M., Wets R. J.-B.Numerical Techniques for Stochastic Optimization (1988) (Springer-Verlag, Berlin) CrossrefGoogle Scholar
  • Frauendorfer K.Two-Stage Stochastic Programming (1992) (Springer-Verlag, Berlin) CrossrefGoogle Scholar
  • Gittins J. C.Multi-Armed Bandit Allocation Indices (1989) (John Wiley & Sons, Chichester) Google Scholar
  • Ho Y. C., Lau T.W.E. Universal alignment probabilities and subset selection for ordinal optimization. J. Optim. Theory Appl. (1997) 93:455–489CrossrefGoogle Scholar
  • Infanger G. Monte-Carlo (importance) sampling within a bender's decomposition for stochastic linear programs. Ann. O. R. (1992) 39:69–95CrossrefGoogle Scholar
  • Kall P.Stochastic Programming (1976) (Springer-Verlag, Berlin) CrossrefGoogle Scholar
  • Lageweg B. J., Lenstra J. K., Rinnooy Kan A. H. G., Stougie L. , Ermoliev Yu., Wets R. J.-B. Stochastic integer programming by dynamic programming. Numerical Techniques for Stochastic Optimization (1988) (Springer-Verlag, Berlin) CrossrefGoogle Scholar
  • Lai T. L. Adaptive treatment allocation and the multi-armed bandit problem. Ann. Statist. (1987) 15:1091–1114CrossrefGoogle Scholar
  • Laporte G., Louveaux F. V. The integer L-shaped method for stochastic integer programs with complete recourse. O. R. Lett. (1993) 13:133–142CrossrefGoogle Scholar
  • Louveaux F. V., van der Vlerk M. H. Stochastic programming with simple integer recourse. Math. Programming (1993) 61:301–325CrossrefGoogle Scholar
  • Minoux M.Programmation Mathématique: Théorie et Algorithmes (1989) (Dunod, Paris) Google Scholar
  • Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley & Sons, New York) CrossrefGoogle Scholar
  • Nurminski E. A.Numerical Methods for Solving Deterministic and Stochastic Minimax Problems (1979) (Naukova Dumka, Kiev. (In Russian)) Google Scholar
  • Rinnooy Kan A. H. G., Stougie L. , Ermoliev Yu., Wets R. J.-B. Stochastic integer programming. Numerical Techniques for Stochastic Optimization (1988) (Springer-Verlag, Berlin) Google Scholar
  • Schultz R., Stougie L., van der Vlerk M. H. Two-stage stochastic integer programming: A survey. Research Memorandum 520. (1993) (Institute of Economic Research, University of Groningen)Google Scholar
  • Sergienko I. V.Mathematical Models and Methods for Solving Discrete Optimization Problems (1988) (Naukova Dumka, Kiev. (In Russian)) Google Scholar
  • Shor N. Z.Minimization Methods for Non-Differentiable Functions (1985) (Springer-Verlag, Berlin) CrossrefGoogle Scholar
  • Stougie L. Design and analysis of algorithms for stochastic integer programming. (1985) . Ph.D. thesis, Centre for Mathematics and Computer Science, AmsterdamGoogle Scholar
  • Tang Z. B. Adaptive partitioned random search to global optimization. IEEE Trans. Automatic Control (1994) 39:2235–2244CrossrefGoogle Scholar
  • Van der Vlerk M. H. Stochastic programming with integer recourse. (1995) . Ph.D. thesis, University of Groningen, Labyrinth Publication, Capelle aan de IJselGoogle Scholar
  • Yan D., Mukai H. Stochastic discrete optimization. SIAM J. Control Optim. (1992) 30:594–612CrossrefGoogle Scholar
  • Young H. P. Dividing the indivisible. (1994) . Working paper WP-94-10, International Institute for Applied Systems Analysis, Laxenburg, AustriaGoogle Scholar
  • Yudin D. B., Tzoy E. V. Integer stochastic programming. Izvestia AN SSSR, Tekhnicheskaya Kibernetika (1974) 1:3–11In RussianGoogle Scholar
  • Using the CPLEX Callable Library and CPLEX Mixed Integer Library (1993) (CPLEX Optimization, Incline Village) Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.