Pages that link to "Item:Q3392103"
From MaRDI portal
The following pages link to Dynamic Bid Prices in Revenue Management (Q3392103):
Displaying 37 items.
- An EMSR-based approach for revenue management with integrated upgrade decisions (Q336562) (← 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)
- Approximate dynamic programming for capacity allocation in the service industry (Q439484) (← 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)
- Revenue management approach to due date quoting and scheduling in an assemble-to-order production system (Q747753) (← 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)
- Optimization and approximation methods for dynamic appointment scheduling with patient choices (Q1651585) (← links)
- Least squares approximate policy iteration for learning bid prices in choice-based revenue management (Q1652041) (← links)
- An approximate dynamic programming approach to attended home delivery management (Q1694837) (← links)
- Linear programming formulation for non-stationary, finite-horizon Markov decision process models (Q1728357) (← links)
- A two-stage bid-price control for make-to-order revenue management (Q1762076) (← links)
- A review of revenue management: recent generalizations and advances in industry applications (Q2178060) (← links)
- Identifying proactive ICU patient admission, transfer and diversion policies in a public-private hospital network (Q2239873) (← links)
- A strong Lagrangian relaxation for general discrete-choice network revenue management (Q2419547) (← links)
- Revenue management for operations with urgent orders (Q2629651) (← links)
- Poisoning finite-horizon Markov decision processes at design time (Q2668608) (← 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)
- Model Predictive Control for Dynamic Resource Allocation (Q2925344) (← links)
- Decomposable Markov Decision Processes: A Fluid Optimization Approach (Q2957475) (← 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 Simplex Method for Countably Infinite Linear Programs (Q5020851) (← 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)
- (Q5168869) (← links)
- Approximate dynamic programming via iterated Bellman inequalities (Q5256802) (← links)
- Hybrid nesting control strategy for passenger railway with one‐seat‐one‐ticket restriction (Q6082283) (← 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)