Technical Note—A Note on Relaxations of the Choice Network Revenue Management Dynamic Program
From MaRDI portal
Publication:2806066
DOI10.1287/opre.2015.1453zbMath1338.90441OpenAlexW2285741262MaRDI QIDQ2806066
Sumit Kunnumkal, Kalyan T. Talluri
Publication date: 13 May 2016
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2015.1453
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Dynamic programming (90C39)
Related Items (5)
A strong Lagrangian relaxation for general discrete-choice network revenue management ⋮ Efficient compact linear programs for network revenue management ⋮ An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals ⋮ A review of choice-based revenue management: theory and methods ⋮ Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy
Cites Work
- Network revenue management with inventory-sensitive bid prices and customer choice
- Generalized polynomial approximations in Markovian decision processes
- An Analysis of Bid-Price Controls for Network Revenue Management
- On a Piecewise-Linear Approximation for Network Revenue Management
- A Column Generation Algorithm for Choice-Based Network Revenue Management
- Asymptotic Behavior of an Allocation Policy for Revenue Management
This page was built for publication: Technical Note—A Note on Relaxations of the Choice Network Revenue Management Dynamic Program
