On the approximate linear programming approach for network revenue management problems

DOI10.1287/IJOC.2013.0551MaRDI QIDQ2967618zbMATH OpenOpenAlexFDO

Authors Chaoxu Tong, Huseyin Topaloglu

Publication date 1 March 2017

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

Full work available at URL https://semanticscholar.org/paper/87e050513414d431fab2741fb9dcc93638d977bb

zbMATH Keywords

airapplicationsapproximate dynamic programmingdynamic programming optimal controlrevenue managementtransportation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Recommendations

• Efficient compact linear programs for network revenue management
• Reductions of approximate linear programs for network revenue management
• Technical note -- Product-based approximate linear programs for network revenue management
• On a piecewise-linear approximation for network revenue management
• A stochastic approximation method to compute bid prices in network revenue management problems

Cites work

• A randomized linear programming method for computing network bid prices
• An analysis of bid-price controls for network revenue management
• Dynamic Bid Prices in Revenue Management
• Network revenue management with inventory-sensitive bid prices and customer choice
• Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management

Cited in

(15)

• Least squares approximate policy iteration for learning bid prices in choice-based revenue management
• Relationship between least squares Monte Carlo and approximate linear programming
• Nonparametric advertising budget allocation with inventory constraint
• Efficient compact linear programs for network revenue management
• Reductions of approximate linear programs for network revenue management
• On a piecewise-linear approximation for network revenue management
• A stochastic approximation method to compute bid prices in network revenue management problems
• Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management
• Technical note -- Product-based approximate linear programs for network revenue management
• Dynamic Relaxations for Online Bipartite Matching
• An approximation algorithm for network revenue management under nonstationary arrivals
• Network-based approximate linear programming for discrete optimization
• The impact of seat resource fragmentation on railway network revenue management
• Reductions of non-separable approximate linear programs for network revenue management
• Approximate Linear programming for a queueing control problem

This page was built for publication: On the approximate linear programming approach for network revenue management problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2967618)