Reductions of Approximate Linear Programs for Network Revenue Management
From MaRDI portal
Publication:2797458
DOI10.1287/opre.2015.1442zbMath1334.90196OpenAlexW2191871932MaRDI QIDQ2797458
Thomas W. M. Vossen, Dan Zhang
Publication date: 5 April 2016
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b2544b2e6e54870a8adc903fadfeaa5ec5569ab2
Related Items
Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management ⋮ Least squares approximate policy iteration for learning bid prices in choice-based revenue management ⋮ A strong Lagrangian relaxation for general discrete-choice network revenue management ⋮ Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources ⋮ Dynamic Relaxations for Online Bipartite Matching ⋮ The impact of seat resource fragmentation on railway network revenue management ⋮ Reductions of non-separable approximate linear programs for network revenue management ⋮ Efficient compact linear programs for network revenue management ⋮ An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals ⋮ An Approximation Algorithm for Capacity Allocation Over a Single Flight Leg with Fare-Locking ⋮ Network-Based Approximate Linear Programming for Discrete Optimization ⋮ A review of choice-based revenue management: theory and methods
Cites Work
- Network revenue management with inventory-sensitive bid prices and customer choice
- Generalized polynomial approximations in Markovian decision processes
- On the equivalence between some discrete and continuous optimization problems
- The Underlying Markov Decision Process in the Single-Leg Airline Yield-Management Problem
- An Analysis of Bid-Price Controls for Network Revenue Management
- On a Piecewise-Linear Approximation for Network Revenue Management
- On the Approximate Linear Programming Approach for Network Revenue Management Problems
- Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management
- Decomposition Principle for Linear Programs
- The Decomposition Algorithm for Linear Programs
- Dual-Optimal Inequalities for Stabilized Column Generation
- Dynamic Bid Prices in Revenue Management
- Relaxations of Weakly Coupled Stochastic Dynamic Programs
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Asymptotic Behavior of an Allocation Policy for Revenue Management
- The Linear Programming Approach to Approximate Dynamic Programming
- A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management
- Approximate Dynamic Programming
- Revenue Management for Parallel Flights with Customer-Choice Behavior
- A Primer in Column Generation
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
