Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management
From MaRDI portal
Publication:3100373
DOI10.1287/opre.1080.0597zbMath1226.90146OpenAlexW2124897406MaRDI QIDQ3100373
Publication date: 24 November 2011
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b567f65b08d13f8495675be8a70847658f26689f
Related Items
A framework for solving network revenue management problems with customer choice behavior ⋮ Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management ⋮ Dynamic Programs with Shared Resources and Signals: Dynamic Fluid Policies and Asymptotic Optimality ⋮ A new bid price approach to dynamic resource allocation in network revenue management ⋮ Optimal resource allocation across related channels ⋮ Opaque selling of multiple substitutable products with finite inventories ⋮ 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 ⋮ Optimal reservation control strategies in shared parking systems considering two types of customers ⋮ Reductions of non-separable approximate linear programs for network revenue management ⋮ Network revenue management with inventory-sensitive bid prices and customer choice ⋮ New Formulations for Choice Network Revenue Management ⋮ Efficient compact linear programs for network revenue management ⋮ On the Approximate Linear Programming Approach for Network Revenue Management Problems ⋮ Improved bid prices for choice-based 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 ⋮ Lagrangian relaxation and constraint generation for allocation and advanced scheduling ⋮ Dynamic control mechanisms for revenue management with flexible products ⋮ Decomposition methods for dynamic room allocation in hotel revenue management ⋮ A review of choice-based revenue management: theory and methods ⋮ Reductions of Approximate Linear Programs for Network Revenue Management ⋮ On a Piecewise-Linear Approximation for Network Revenue Management ⋮ A duality-based relaxation and decomposition approach for inventory distribution systems ⋮ On the asymptotic optimality of the randomized linear program for network revenue management ⋮ A network revenue management model with capacity allocation and overbooking ⋮ On bid-price controls for network revenue management ⋮ Asymptotically Optimal Lagrangian Policies for Multi-Warehouse, Multi-Store Systems with Lost Sales
