Optimal Selection of Customers for a Last-Minute Offer
Author
Abstract
Suggested Citation
DOI: 10.1287/opre.1090.0787
Download full text from publisher
References listed on IDEAS
- Jan Roelf Bult & Tom Wansbeek, 1995. "Optimal Selection for Direct Mail," Marketing Science, INFORMS, vol. 14(4), pages 378-394.
- Loren K. Platzman & Jane C. Ammons & John J. Bartholdi, 1988. "A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms," Operations Research, INFORMS, vol. 36(1), pages 137-144, February.
- Brian C. Dean & Michel X. Goemans & Jan Vondrák, 2008. "Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 945-964, November.
- Claude Chriqui & Pierre Robillard, 1975. "Common Bus Lines," Transportation Science, INFORMS, vol. 9(2), pages 115-121, May.
- Michael O. Ball & Maurice Queyranne, 2009. "Toward Robust Revenue Management: Competitive Analysis of Online Booking," Operations Research, INFORMS, vol. 57(4), pages 950-963, August.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Huanan Zhang & Cong Shi & Chao Qin & Cheng Hua, 2016. "Stochastic regret minimization for revenue management problems with nonstationary demands," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(6), pages 433-448, September.
- Tong, C.O. & Wong, S.C., 1998. "A stochastic transit assignment model using a dynamic schedule-based network," Transportation Research Part B: Methodological, Elsevier, vol. 33(2), pages 107-121, April.
- Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
- Paulsen, Mads & Rasmussen, Thomas Kjær & Nielsen, Otto Anker, 2021. "Impacts of real-time information levels in public transport: A large-scale case study using an adaptive passenger path choice model," Transportation Research Part A: Policy and Practice, Elsevier, vol. 148(C), pages 155-182.
- Wu, Di & Yin, Yafeng & Lawphongpanich, Siriphong, 2011. "Pareto-improving congestion pricing on multimodal transportation networks," European Journal of Operational Research, Elsevier, vol. 210(3), pages 660-669, May.
- Durango-Cohen, Elizabeth J., 2013. "Modeling contribution behavior in fundraising: Segmentation analysis for a public broadcasting station," European Journal of Operational Research, Elsevier, vol. 227(3), pages 538-551.
- Codina, Esteve & Rosell, Francisca, 2017. "A heuristic method for a congested capacitated transit assignment model with strategies," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 293-320.
- Adam J. Mersereau & Dan Zhang, 2012. "Markdown Pricing with Unknown Fraction of Strategic Customers," Manufacturing & Service Operations Management, INFORMS, vol. 14(3), pages 355-370, July.
- Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
- YongSeog Kim & W. Nick Street & Gary J. Russell & Filippo Menczer, 2005. "Customer Targeting: A Neural Network Approach Guided by Genetic Algorithms," Management Science, INFORMS, vol. 51(2), pages 264-276, February.
- Thomas J. Steenburgh & Andrew Ainslie & Peder Hans Engebretson, 2003. "Massively Categorical Variables: Revealing the Information in Zip Codes," Marketing Science, INFORMS, vol. 22(1), pages 40-57, August.
- Mahsa Samsami & Ralf Wagner, 2021. "Investment Decisions with Endogeneity: A Dirichlet Tree Analysis," JRFM, MDPI, vol. 14(7), pages 1-19, July.
- Martin Skutella & Maxim Sviridenko & Marc Uetz, 2016. "Unrelated Machine Scheduling with Stochastic Processing Times," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 851-864, August.
- repec:dgr:rugsom:02f59 is not listed on IDEAS
- Bas Donkers & Richard Paap & Jedid‐Jah Jonker & Philip Hans Franses, 2006.
"Deriving target selection rules from endogenously selected samples,"
Journal of Applied Econometrics, John Wiley & Sons, Ltd., vol. 21(5), pages 549-562, July.
- Richard Paap & Philip Hans Franses & Bas Donkers & Jedid-Jah Jonker, 2006. "Deriving target selection rules from endogenously selected samples," Journal of Applied Econometrics, John Wiley & Sons, Ltd., vol. 21(5), pages 549-562.
- Donkers, A.C.D. & Jonker, J.-J. & Franses, Ph.H.B.F. & Paap, R., 2001. "Deriving Target Selection Rules from Endogenously Selected Samples," ERIM Report Series Research in Management ERS-2001-68-MKT, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
- Retsef Levi & Georgia Perakis & Joline Uichanco, 2015. "The Data-Driven Newsvendor Problem: New Bounds and Insights," Operations Research, INFORMS, vol. 63(6), pages 1294-1306, December.
- Wang, David Z.W. & Nayan, Ashish & Szeto, W.Y., 2018. "Optimal bus service design with limited stop services in a travel corridor," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 70-86.
- Roberto Cominetti & José Correa, 2001. "Common-Lines and Passenger Assignment in Congested Transit Networks," Transportation Science, INFORMS, vol. 35(3), pages 250-267, August.
- Belgacem Bouzaïene-Ayari & Michel Gendreau & Sang Nguyen, 2001. "Modeling Bus Stops in Transit Networks: A Survey and New Formulations," Transportation Science, INFORMS, vol. 35(3), pages 304-321, August.
- Homero Larrain & Juan Muñoz, 2008. "Public Transit Corridor Assignment Assuming Congestion Due to Passenger Boarding and Alighting," Networks and Spatial Economics, Springer, vol. 8(2), pages 241-256, September.
- Danijel Bratina & Armand Faganel, 2023. "Using Supervised Machine Learning Methods for RFM Segmentation: A Casino Direct Marketing Communication Case," Tržište/Market, Faculty of Economics and Business, University of Zagreb, vol. 35(1), pages 7-22.
More about this item
Keywords
promotional sale; linear programming relaxations; approximation algorithms;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:58:y:2010:i:4-part-1:p:878-888. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.