Bid-Price Controls for Network Revenue Management: Martingale Characterization of Optimal Bid Prices
Mathematics of Operations Research
Robust Controls for Network Revenue Management
Manufacturing & Service Operations Management
Computing Time-Dependent Bid Prices in Network Revenue Management Problems
Transportation Science
Dynamic control mechanisms for revenue management with flexible products
Computers and Operations Research
Approximate Dynamic Programming for Ambulance Redeployment
INFORMS Journal on Computing
A Dynamic Programming Decomposition Method for Making Overbooking Decisions Over an Airline Network
INFORMS Journal on Computing
An Improved Dynamic Programming Decomposition Approach for Network Revenue Management
Manufacturing & Service Operations Management
A two-stage bid-price control for make-to-order revenue management
Computers and Operations Research
Network Cargo Capacity Management
Operations Research
Computing Bid Prices for Revenue Management Under Customer Choice Behavior
Manufacturing & Service Operations Management
A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice
Mathematics of Operations Research
Cargo Capacity Management with Allotments and Spot Market Demand
Operations Research
Model Predictive Control for Dynamic Resource Allocation
Mathematics of Operations Research
Simulation-based methods for booking control in network revenue management
Proceedings of the Winter Simulation Conference
Assessing the Value of Dynamic Pricing in Network Revenue Management
INFORMS Journal on Computing
Bid Prices When Demand Is a Mix of Individual and Batch Bookings
Transportation Science
| Hi-index | 0.00 |
We formally derive the standard deterministic linear program (LP) for bid-price control by making an affine functional approximation to the optimal dynamic programming value function. This affine functional approximation gives rise to a new LP that yields tighter bounds than the standard LP. Whereas the standard LP computes static bid prices, our LP computes a time trajectory of bid prices. We show that there exist dynamic bid prices, optimal for the LP, that are individually monotone with respect to time. We provide a column generation procedure for solving the LP within a desired optimality tolerance, and present numerical results on computational and economic performance.