A Tractable Consideration Set Structure for Network Revenue Management
The dynamic program for choice network RM is intractable and approximated by a deterministic linear program called the CDLP. When the segment consideration sets overlap, the CDLP is difficult to solve. A weaker formulation (SDCP+) is tractable and approximates the CDLP value very closely. We show that if the segment consideration sets follow a tree structure, the two problems are equivalent, and give a counterexample to show that cycles can induce a gap between CDLP and the relaxation.
|Date of creation:||Feb 2012|
|Contact details of provider:|| Postal: Ramon Trias Fargas, 25-27, 08005 Barcelona|
Phone: +34 93 542-1222
Fax: +34 93 542-1223
Web page: http://www.barcelonagse.eu
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- 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 Graduate School of Economics.
- Joern Meissner & Arne Strauss & Kalyan Talluri, 2011. "An Enhanced Concave Program Relaxation for Choice Network Revenue Management," Working Papers MRG/0020, Department of Management Science, Lancaster University, revised Jan 2011.
- Joern Meissner & Arne Strauss, 2008.
"Network Revenue Management with Inventory-Sensitive Bid Prices and Customer Choice,"
MRG/0008, Department of Management Science, Lancaster University, revised Apr 2010.
- 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.
When requesting a correction, please mention this item's handle: RePEc:bge:wpaper:606. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Bruno Guallar)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.