Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management
From MaRDI portal
Publication:3100373
DOI10.1287/opre.1080.0597zbMath1226.90146MaRDI 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
Asymptotically Optimal Lagrangian Policies for Multi-Warehouse, Multi-Store Systems with Lost Sales, Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management, Dynamic Programs with Shared Resources and Signals: Dynamic Fluid Policies and Asymptotic Optimality, Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources, An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals, An Approximation Algorithm for Capacity Allocation Over a Single Flight Leg with Fare-Locking, Opaque selling of multiple substitutable products with finite inventories, Optimal reservation control strategies in shared parking systems considering two types of customers, Reductions of non-separable approximate linear programs for network revenue management, A framework for solving network revenue management problems with customer choice behavior, A new bid price approach to dynamic resource allocation in network revenue management, Network revenue management with inventory-sensitive bid prices and customer choice, Improved bid prices for choice-based network revenue management, Decomposition methods for dynamic room allocation in hotel revenue management, A review of choice-based revenue management: theory and methods, A network revenue management model with capacity allocation and overbooking, Dynamic control mechanisms for revenue management with flexible products, On the asymptotic optimality of the randomized linear program for network revenue management, Lagrangian relaxation and constraint generation for allocation and advanced scheduling, Optimal resource allocation across related channels, A strong Lagrangian relaxation for general discrete-choice network revenue management, Efficient compact linear programs for network revenue management, Reductions of Approximate Linear Programs for Network Revenue Management, On a Piecewise-Linear Approximation for Network Revenue Management, New Formulations for Choice Network Revenue Management, On the Approximate Linear Programming Approach for Network Revenue Management Problems, A duality-based relaxation and decomposition approach for inventory distribution systems, On bid-price controls for network revenue management
