Reductions of non-separable approximate linear programs for network revenue management
From MaRDI portal
Publication:6167751
DOI10.1016/j.ejor.2023.01.006OpenAlexW4314446174MaRDI QIDQ6167751
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.01.006
reductionsrevenue managementapproximate dynamic programmingnon-separabilitynetwork revenue management
Cites Work
- Unnamed Item
- A new bid price approach to dynamic resource allocation in network revenue management
- Network revenue management with inventory-sensitive bid prices and customer choice
- Generalized polynomial approximations in Markovian decision processes
- New linear program performance bounds for queueing networks
- The theory and practice of revenue management
- A strong Lagrangian relaxation for general discrete-choice network revenue management
- Revenue Management: Research Overview and Prospects
- An Analysis of Bid-Price Controls for Network Revenue Management
- Reductions of Approximate Linear Programs for Network Revenue Management
- On a Piecewise-Linear Approximation for Network Revenue Management
- Computing Near-Optimal Policies in Generalized Joint Replenishment
- On the Approximate Linear Programming Approach for Network Revenue Management Problems
- Approximate Dynamic Programming
- Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management
- A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice
- Decomposition Principle for Linear Programs
- Dynamic Bid Prices in Revenue Management
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- The Linear Programming Approach to Approximate Dynamic Programming
- SPLINE APPROXIMATIONS TO VALUE FUNCTIONS
- Revenue Management Under the Markov Chain Choice Model
- An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals
- A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem
- A Price-Directed Approach to Stochastic Inventory/Routing
- An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
