A Dynamic Programming Decomposition Method for Making Overbooking Decisions Over an Airline Network

DOI10.1287/ijoc.1090.0359zbMath1243.90104OpenAlexW2134080105MaRDI QIDQ2899078

Alexander Erdélyi, Huseyin Topaloglu

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0cb4cd3b10e4fc9e4e272c392e9a4608b1cc5bfb

zbMATH Keywords

dynamic programmingnetwork revenue managementoverbooking approximate

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Case-oriented studies in operations research (90B90) Dynamic programming (90C39)

Related Items (10)

Analysis of seat allocation and overbooking decisions with hybrid information ⋮ Revenue management under customer choice behaviour with cancellations and overbooking ⋮ Multi-class, multi-resource advance scheduling with no-shows, cancellations and overbooking ⋮ A review of revenue management: recent generalizations and advances in industry applications ⋮ An Approximation Algorithm for Capacity Allocation Over a Single Flight Leg with Fare-Locking ⋮ A stochastic approximation algorithm to compute bid prices for joint capacity allocation and overbooking over an airline network ⋮ Integrated revenue management approaches for capacity control with planned upgrades ⋮ On a Piecewise-Linear Approximation for Network Revenue Management ⋮ An LP based approximate dynamic programming model to address airline overbooking under cancellation, refund and no-show ⋮ A network revenue management model with capacity allocation and overbooking

This page was built for publication: A Dynamic Programming Decomposition Method for Making Overbooking Decisions Over an Airline Network