论文信息 - A cutting-plane procedure for maximizing revenues in yield management

A cutting-plane procedure for maximizing revenues in yield management

A graph-theory approach for allocating seats and setting optimal prices in an origin-destination (O-D) network is developed. Input includes demand forecasts, computer reservation system restrictions, and aircraft capacities. The concept of a split graph is used to derive cutting planes.

Alberto Garcia-Diaz | Ahmet Kuyumcu

[1] M. Padberg,et al. Solving airline crew scheduling problems by branch-and-cut , 1993 .

[2] G Robertcross,et al. Revenue management: Hard-core tactics for market domination: by Robert G. Cross. Broadway Books, 1540 Broadway, New York, NY 10036, 1997. 276 pp. Hardcover, $27.50 , 1997 .

[3] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[4] Samuel E. Bodily,et al. A Taxonomy and Research Overview of Perishable-Asset Revenue Management: Yield Management, Overbooking, and Pricing , 1992, Oper. Res..

[5] S. Kimes. Yield management: A tool for capacity-considered service firms , 1989 .

[6] Manfred W. Padberg,et al. On the facial structure of set packing polyhedra , 1973, Math. Program..