Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management.
Huseyin TopalogluPublished in: Oper. Res. (2009)
Keyphrases
- network revenue management
- lagrangian relaxation
- capacity constraints
- integer programming
- bid prices
- online auctions
- branch and bound algorithm
- np hard
- lower and upper bounds
- feasible solution
- lower bound
- linear programming
- column generation
- dynamic programming
- mixed integer programming
- shortest path
- demand function
- optimal solution
- production planning
- search algorithm