Pages that link to "Item:Q3168963"
From MaRDI portal
The following pages link to An Asymptotically Optimal Policy for a Quantity-Based Network Revenue Management Problem (Q3168963):
Displaying 24 items.
- A framework for solving network revenue management problems with customer choice behavior (Q300793) (← links)
- On the impact of information disclosure on advance reservations: a game-theoretic view (Q1754285) (← links)
- Preemptible queues with advance reservations: strategic behavior and revenue management (Q2030299) (← links)
- Standardized cargo network revenue management with dual channels under stochastic and time-dependent demand (Q2239867) (← links)
- An LP-based correlated rounding scheme for multi-item ecommerce order fulfillment (Q2797457) (← links)
- A re-solving heuristic with bounded revenue loss for network revenue management with customer choice (Q2884320) (← links)
- Model predictive control for dynamic resource allocation (Q2925344) (← links)
- Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources (Q3100484) (← links)
- Performance of an LP-Based Control for Revenue Management with Unknown Demand Parameters (Q3465593) (← links)
- On bid-price controls for network revenue management (Q3466712) (← links)
- Asymptotic Behavior of an Allocation Policy for Revenue Management (Q3635132) (← links)
- Dynamic pricing and replenishment: Optimality, bounds, and asymptotics (Q4562935) (← links)
- Analysis of Deterministic Control and Its Improvements for an Inventory Problem with Multiproduct Batch Differentiation (Q4969308) (← links)
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (Q5058054) (← links)
- Constant Regret Resolving Heuristics for Price-Based Revenue Management (Q5060522) (← links)
- Technical Note—A Near-Optimal Algorithm for Real-Time Order Acceptance: An Application in Postacute Healthcare Services (Q5106365) (← links)
- Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources (Q5106367) (← links)
- Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
- Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements (Q5130501) (← links)
- Online Network Revenue Management Using Thompson Sampling (Q5131540) (← links)
- Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios (Q5144796) (← links)
- Asymptotically optimal dynamic pricing for network revenue management (Q5168855) (← links)
- Opaque selling of multiple substitutable products with finite inventories (Q6051576) (← links)
- Optimizing hospital bed allocation for coordinated medical efficiency and quality improvement (Q6646754) (← links)