Optimal Selection of Customers for a Last-Minute Offer

References

• Ball M., Queyranne M. Toward robust revenue management: Competitive analysis of online booking. Oper. Res. (2009) 57:950–963Link, Google Scholar
• Bult J. R., Wansbeek T. Optimal selection for direct mail. Marketing Sci. (1995) 14:378–394Link, Google Scholar
• Chriqui C., Robillard P. Common bus lines. Transportation Sci. (1975) 9:115–121Link, Google Scholar
• Cominetti R., Vaisman J. A sharp uniform bound for the distribution of a sum of Bernoulli random variables. (2008) . Preprint, Departamento de Ingeniería Matemática, Universidad de Chile, Santiago, ChileGoogle Scholar
• Cormen T., Leiserson C., Rivest R., Stein C.Introduction to Algorithms (2001) (MIT Press, Cambridge, MA) Google Scholar
• Dean B., Goemans M. X., Vondrak J. Approximating the stochastic knapsack problem: The benefit of adaptivity. Math. Oper. Res. (2008) 33:945–964Link, Google Scholar
• Jogdeo K., Samuels S. M. Monotone convergence of binomial probabilities and a generalization of Ramanujan's equation. Ann. Math. Statist. (1968) 39:1191–1195Crossref, Google Scholar
• Littlewood K. Forecasting and control of passengers. 12th AGIFORS Sympos. Proc. (1972) 95–128Google Scholar
• Platzman L., Ammnos J., Bartholdi III J. A simple and efficient algorithm to compute tail probabilities from transforms. Oper. Res. (1988) 36:137–144Link, Google Scholar
• Talluri K. T., van Ryzin G. J.The Theory and Practice of Revenue Management (2005) (Springer-Verlag, New York) Crossref, Google Scholar
• Siegel A. Median bounds and their applications. J. Algorithms (2001) 38:184–236Crossref, Google Scholar
• Vaisman J. Convergencia fuerte del método de medias sucesivas para operadores lineales no-expansivos. (2005) . Memoria de Ingeniería Civil Matemática, Universidad de Chile, Santiago, ChileGoogle Scholar