Equivalence of piecewise-linear approximation and Lagrangian relaxation for network revenue management
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- 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.
- 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.
- Isabelle Huault & V. Perret & S. Charreire-Petit, 2007. "Management," Post-Print halshs-00337676, HAL.
- Sumit Kunnumkal & Huseyin Topaloglu, 2010. "Computing Time-Dependent Bid Prices in Network Revenue Management Problems," Transportation Science, INFORMS, vol. 44(1), pages 38-62, February.
- Huseyin Topaloglu, 2009. "Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management," Operations Research, INFORMS, vol. 57(3), pages 637-649, June.
- Daniel Adelman, 2007. "Dynamic Bid Prices in Revenue Management," Operations Research, INFORMS, vol. 55(4), pages 647-661, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- David B. Brown & James E. Smith, 2014. "Information Relaxations, Duality, and Convex Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 62(6), pages 1394-1415, December.
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.- Sumit Kunnumkal & Kalyan Talluri, 2011. "Equivalence of Piecewise-Linear Approximation and Lagrangian Relaxation for Network Revenue Management," Working Papers 608, Barcelona School of Economics.
- 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.
- David Sayah, 2015. "Approximate Linear Programming in Network Revenue Management with Multiple Modes," Working Papers 1518, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
- 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.
- Nicolas Houy & François Le Grand, 2015. "The Monte Carlo first-come-first-served heuristic for network revenue management," Working Papers halshs-01155698, HAL.
- Huang, Kuancheng & Lin, Chia-Yi, 2014. "A simulation analysis for the re-solving issue of the network revenue management problem," Journal of Air Transport Management, Elsevier, vol. 38(C), pages 36-42.
- 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.
- 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.
- 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.
- 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.
- 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, 2016. "On a Piecewise-Linear Approximation for Network Revenue Management," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 72-91, February.
- Strauss, Arne K. & Klein, Robert & Steinhardt, Claudius, 2018. "A review of choice-based revenue management: Theory and methods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 375-387.
- 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.
- Dong Li & Zhan Pang & Lixian Qian, 2023. "Bid price controls for car rental network revenue management," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 261-282, January.
- 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.
- Wuyang Yuan & Lei Nie & Xin Wu & Huiling Fu, 2018. "A dynamic bid price approach for the seat inventory control problem in railway networks with consideration of passenger transfer," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-23, August.
- Hossein Jahandideh & Julie Ward Drew & Filippo Balestrieri & Kevin McCardle, 2020. "Individualized Pricing for a Cloud Provider Hosting Interactive Applications," Service Science, INFORMS, vol. 12(4), pages 130-147, December.
- Kalyan Talluri, 2014. "New Formulations for Choice Network Revenue Management," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 401-413, May.
- 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.
More about this item
Keywords
network revenue management; linear programming; approximate dynamic programming; Lagrangian relaxation methods;All these keywords.
JEL classification:
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- L93 - Industrial Organization - - Industry Studies: Transportation and Utilities - - - Air Transportation
- L83 - Industrial Organization - - Industry Studies: Services - - - Sports; Gambling; Restaurants; Recreation; Tourism
- M11 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Business Administration - - - Production Management
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:upf:upfgen:1305. 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: the person in charge (email available below). General contact details of provider: http://www.econ.upf.edu/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.