An Enhanced Concave Program Relaxation for Choice Network Revenue Management
Author
Abstract
Suggested Citation
Download full text from publisher
Other versions of this item:
- Joern Meissner & Arne Strauss & Kalyan Talluri, 2011. "An enhanced concave program relaxation for choice network revenue management," Economics Working Papers 1259, Department of Economics and Business, Universitat Pompeu Fabra, revised Aug 2011.
- Joern Meissner & Arne Strauss & Kalyan Talluri, 2011. "An Enhanced Concave Program Relaxation for Choice Network Revenue Management," Working Papers 534, Barcelona School of Economics.
References listed on IDEAS
- Kalyan Talluri & Garrett van Ryzin, 1999. "A Randomized Linear Programming Method for Computing Network Bid Prices," Transportation Science, INFORMS, vol. 33(2), pages 207-216, May.
- Meissner, Joern & Strauss, Arne, 2012.
"Network revenue management with inventory-sensitive bid prices and customer choice,"
European Journal of Operational Research, Elsevier, vol. 216(2), pages 459-468.
- Joern Meissner & Arne Strauss, 2008. "Network Revenue Management with Inventory-Sensitive Bid Prices and Customer Choice," Working Papers MRG/0008, Department of Management Science, Lancaster University, revised Apr 2010.
- Qian Liu & Garrett van Ryzin, 2008. "On the Choice-Based Linear Programming Model for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 10(2), pages 288-310, October.
- Dan Zhang & Daniel Adelman, 2009. "An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice," Transportation Science, INFORMS, vol. 43(3), pages 381-394, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Meissner, Joern & Strauss, Arne, 2012.
"Network revenue management with inventory-sensitive bid prices and customer choice,"
European Journal of Operational Research, Elsevier, vol. 216(2), pages 459-468.
- Joern Meissner & Arne Strauss, 2008. "Network Revenue Management with Inventory-Sensitive Bid Prices and Customer Choice," Working Papers MRG/0008, Department of Management Science, Lancaster University, revised Apr 2010.
- Xinan Yang & Arne K. Strauss & Christine S. M. Currie & Richard Eglese, 2016. "Choice-Based Demand Management and Vehicle Routing in E-Fulfillment," Transportation Science, INFORMS, vol. 50(2), pages 473-488, May.
- W. Zachary Rayfield & Paat Rusmevichientong & Huseyin Topaloglu, 2015. "Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 335-357, May.
- Arne Strauss & Kalyan Talluri, 2012. "A Tractable Consideration Set Structure for Network Revenue Management," Working Papers 606, Barcelona School of Economics.
- Guillermo Gallego & Huseyin Topaloglu, 2014. "Constrained Assortment Optimization for the Nested Logit Model," Management Science, INFORMS, vol. 60(10), pages 2583-2601, October.
- Sumit Kunnumkal & Kalyan Talluri, 2012. "A New Compact Linear Programming Formulation for Choice Network Revenue Management," Working Papers 677, Barcelona School of Economics.
- Dan Zhang & Larry Weatherford, 2017. "Dynamic Pricing for Network Revenue Management: A New Approach and Application in the Hotel Industry," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 18-35, February.
- Sumit Kunnumkal & Kalyan Talluri, 2012. "A new compact linear programming formulation for choice network revenue management," Economics Working Papers 1349, Department of Economics and Business, Universitat Pompeu Fabra.
- Arne Strauss & Kalyan Talluri, 2012. "A tractable consideration set structure for network revenue management," Economics Working Papers 1303, Department of Economics and Business, Universitat Pompeu Fabra, revised Oct 2012.
- Kalyan Talluri, 2014. "New Formulations for Choice Network Revenue Management," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 401-413, May.
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.- Nicolas Houy & François Le Grand, 2015. "The Monte Carlo first-come-first-served heuristic for network revenue management," Working Papers halshs-01155698, HAL.
- Kalyan Talluri, 2014. "New Formulations for Choice Network Revenue Management," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 401-413, May.
- Meissner, Joern & Strauss, Arne, 2012.
"Improved bid prices for choice-based network revenue management,"
European Journal of Operational Research, Elsevier, vol. 217(2), pages 417-427.
- Joern Meissner & Arne Strauss, 2010. "Improved Bid Prices for Choice-Based Network Revenue Management," Working Papers MRG/0016, Department of Management Science, Lancaster University, revised Jan 2010.
- Nicolas Houy & François Le Grand, 2015. "Financing and advising with (over)confident entrepreneurs : an experimental investigation," Working Papers 1514, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
- Meissner, Joern & Strauss, Arne, 2012.
"Network revenue management with inventory-sensitive bid prices and customer choice,"
European Journal of Operational Research, Elsevier, vol. 216(2), pages 459-468.
- Joern Meissner & Arne Strauss, 2008. "Network Revenue Management with Inventory-Sensitive Bid Prices and Customer Choice," Working Papers MRG/0008, Department of Management Science, Lancaster University, revised Apr 2010.
- Thomas W. M. Vossen & Dan Zhang, 2015. "Reductions of Approximate Linear Programs for Network Revenue Management," Operations Research, INFORMS, vol. 63(6), pages 1352-1371, December.
- Yuhang Ma & Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. "An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals," Operations Research, INFORMS, vol. 68(3), pages 834-855, May.
- Sumit Kunnumkal & Kalyan Talluri, 2019. "Choice Network Revenue Management Based on New Tractable Approximations," Transportation Science, INFORMS, vol. 53(6), pages 1591-1608, November.
- Sumit Kunnumkal & Kalyan Talluri, 2016. "Technical Note—A Note on Relaxations of the Choice Network Revenue Management Dynamic Program," Operations Research, INFORMS, vol. 64(1), pages 158-166, February.
- Mika Sumida & Huseyin Topaloglu, 2019. "An Approximation Algorithm for Capacity Allocation Over a Single Flight Leg with Fare-Locking," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 83-99, February.
- Chaoxu Tong & Huseyin Topaloglu, 2014. "On the Approximate Linear Programming Approach for Network Revenue Management Problems," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 121-134, February.
- Paat Rusmevichientong & Zuo-Jun Max Shen & David B. Shmoys, 2010. "Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint," Operations Research, INFORMS, vol. 58(6), pages 1666-1680, December.
- Paat Rusmevichientong & Huseyin Topaloglu, 2012. "Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model," Operations Research, INFORMS, vol. 60(4), pages 865-882, August.
- Li, Dong & Pang, Zhan, 2017. "Dynamic booking control for car rental revenue management: A decomposition approach," European Journal of Operational Research, Elsevier, vol. 256(3), pages 850-867.
- Dan Zhang, 2011. "An Improved Dynamic Programming Decomposition Approach for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 13(1), pages 35-52, April.
- Sumit Kunnumkal & Kalyan Talluri, 2019. "A strong Lagrangian relaxation for general discrete-choice network revenue management," Computational Optimization and Applications, Springer, vol. 73(1), pages 275-310, May.
- Juan M. Chaneton & Gustavo Vulcano, 2011. "Computing Bid Prices for Revenue Management Under Customer Choice Behavior," Manufacturing & Service Operations Management, INFORMS, vol. 13(4), pages 452-470, October.
- Sumit Kunnumkal & Kalyan Talluri, 2012. "A New Compact Linear Programming Formulation for Choice Network Revenue Management," Working Papers 677, Barcelona School of Economics.
- Sumit Kunnumkal & Kalyan Talluri, 2012. "A new compact linear programming formulation for choice network revenue management," Economics Working Papers 1349, Department of Economics and Business, Universitat Pompeu Fabra.
- Stefanus Jasin & Sunil Kumar, 2012. "A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 313-345, May.
More about this item
Keywords
operations research; marketing; bid prices; yield management; heuristics; discrete-choice; network revenue management;All these keywords.
JEL classification:
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- M11 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Business Administration - - - Production Management
- M31 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Marketing and Advertising - - - Marketing
- L93 - Industrial Organization - - Industry Studies: Transportation and Utilities - - - Air Transportation
- L83 - Industrial Organization - - Industry Studies: Services - - - Sports; Gambling; Restaurants; Recreation; Tourism
NEP fields
This paper has been announced in the following NEP Reports:- NEP-CMP-2011-02-05 (Computational Economics)
- NEP-COM-2011-02-05 (Industrial Competition)
- NEP-DCM-2011-02-05 (Discrete Choice Models)
- NEP-MIC-2011-02-05 (Microeconomics)
- NEP-NET-2011-02-05 (Network Economics)
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:lms:mansci:mrg-0020. 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: Joern Meissner (email available below). General contact details of provider: https://edirc.repec.org/data/degraus.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.