Pages that link to "Item:Q3100373"

The following pages link to Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management (Q3100373):

Displaying 28 items.

• A framework for solving network revenue management problems with customer choice behavior (Q300793) (← links)
• A new bid price approach to dynamic resource allocation in network revenue management (Q323502) (← links)
• Network revenue management with inventory-sensitive bid prices and customer choice (Q421775) (← links)
• Improved bid prices for choice-based network revenue management (Q439392) (← links)
• Decomposition methods for dynamic room allocation in hotel revenue management (Q724073) (← links)
• A review of choice-based revenue management: theory and methods (Q724103) (← links)
• A network revenue management model with capacity allocation and overbooking (Q780190) (← links)
• Dynamic control mechanisms for revenue management with flexible products (Q976024) (← links)
• On the asymptotic optimality of the randomized linear program for network revenue management (Q1042002) (← links)
• Lagrangian relaxation and constraint generation for allocation and advanced scheduling (Q1761167) (← links)
• Optimal resource allocation across related channels (Q2417176) (← links)
• A strong Lagrangian relaxation for general discrete-choice network revenue management (Q2419547) (← links)
• Efficient compact linear programs for network revenue management (Q2688923) (← links)
• Reductions of Approximate Linear Programs for Network Revenue Management (Q2797458) (← links)
• On a Piecewise-Linear Approximation for Network Revenue Management (Q2800364) (← links)
• New Formulations for Choice Network Revenue Management (Q2962567) (← links)
• On the Approximate Linear Programming Approach for Network Revenue Management Problems (Q2967618) (← links)
• On bid-price controls for network revenue management (Q3466712) (← links)
• A duality-based relaxation and decomposition approach for inventory distribution systems (Q3627933) (← links)
• Asymptotically Optimal Lagrangian Policies for Multi-Warehouse, Multi-Store Systems with Lost Sales (Q5031005) (← links)
• Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management (Q5058047) (← links)
• Dynamic Programs with Shared Resources and Signals: Dynamic Fluid Policies and Asymptotic Optimality (Q5058058) (← links)
• Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources (Q5106367) (← links)
• An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals (Q5130511) (← links)
• An Approximation Algorithm for Capacity Allocation Over a Single Flight Leg with Fare-Locking (Q5137438) (← links)
• Opaque selling of multiple substitutable products with finite inventories (Q6051576) (← links)
• Optimal reservation control strategies in shared parking systems considering two types of customers (Q6164610) (← links)
• Reductions of non-separable approximate linear programs for network revenue management (Q6167751) (← links)