Dynamic booking rules for flights with an intermediate stop
A feasible model has been developed to find the optimal decision rule for allocating seats to passengers seeking to fly on the long or short span of a flight with an intermediate stop from which no boarding rights exist to take passengers to the terminal stop. The model is feasible from the point of view of estimating the data and of computer calculation and memory capacity and is implementable under real life conditions. A computer program was written and a short sample problem was calculated to show the differences in computation time and memory requirements vs the loss of revenue in comparison with a complicated and thus unfeasible higher order model.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 5 (1977)
Issue (Month): 6 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:5:y:1977:i:6:p:721-730. 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: (Zhang, Lei)
If references are entirely missing, you can add them using this form.