Pages that link to "Item:Q2797458"
From MaRDI portal
The following pages link to Reductions of Approximate Linear Programs for Network Revenue Management (Q2797458):
Displaying 12 items.
- A review of choice-based revenue management: theory and methods (Q724103) (← links)
- Least squares approximate policy iteration for learning bid prices in choice-based revenue management (Q1652041) (← links)
- A strong Lagrangian relaxation for general discrete-choice network revenue management (Q2419547) (← links)
- Efficient compact linear programs for network revenue management (Q2688923) (← links)
- Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management (Q5058047) (← links)
- Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources (Q5106367) (← links)
- Dynamic Relaxations for Online Bipartite Matching (Q5106387) (← 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)
- Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
- The impact of seat resource fragmentation on railway network revenue management (Q6146863) (← links)
- Reductions of non-separable approximate linear programs for network revenue management (Q6167751) (← links)
