An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals
From MaRDI portal
Publication:5130511
DOI10.1287/opre.2019.1931zbMath1445.90045OpenAlexW3023219007MaRDI QIDQ5130511
Paat Rusmevichientong, Yuhang Ma, Mika Sumida, Huseyin Topaloglu
Publication date: 4 November 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2019.1931
Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)
Related Items
Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management ⋮ Constant Regret Resolving Heuristics for Price-Based Revenue Management ⋮ Technical Note—Online Hypergraph Matching with Delays ⋮ Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources ⋮ Reductions of non-separable approximate linear programs for network revenue management
Cites Work
- Advertisement allocation for generalized second-pricing schemes
- Pricing substitutable flights in airline revenue management
- A Randomized Linear Programming Method for Computing Network Bid Prices
- 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
- Technical Note—A Note on Relaxations of the Choice Network Revenue Management Dynamic Program
- Geometry of Online Packing Linear Programs
- A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem
- A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice
- A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems
- A Dynamic Near-Optimal Algorithm for Online Linear Programming
- Information Relaxations, Duality, and Convex Stochastic Dynamic Programs
- New Formulations for Choice 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
- A Column Generation Algorithm for Choice-Based Network Revenue Management
- Stochastic Depletion Problems: Effective Myopic Policies for a Class of Dynamic Optimization Problems
- Dynamic Bid Prices in Revenue Management
- Simulation-Based Optimization of Virtual Nesting Controls for Network Revenue Management
- AdWords and generalized online matching
- Online Stochastic Packing Applied to Display Ad Allocation
- Asymptotic Behavior of an Allocation Policy for Revenue Management
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- Analysis of Deterministic LP-Based Booking Limit and Bid Price Controls for Revenue Management
- Primal beats dual on online packing LPs in the random-order model
- Revenue Management for Parallel Flights with Customer-Choice Behavior
- Online Advertisement, Optimization and Stochastic Networks
- A refined deterministic linear program for the network revenue management problem with customer choice behavior
