Pages that link to "Item:Q2884320"

The following pages link to A re-solving heuristic with bounded revenue loss for network revenue management with customer choice (Q2884320):

Displaying 26 items.

• A framework for solving network revenue management problems with customer choice behavior (Q300793) (← links)
• A review of choice-based revenue management: theory and methods (Q724103) (← links)
• An LP-based correlated rounding scheme for multi-item ecommerce order fulfillment (Q2797457) (← links)
• Model predictive control for dynamic resource allocation (Q2925344) (← links)
• A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice (Q3195240) (← 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)
• Dynamic pricing and replenishment: Optimality, bounds, and asymptotics (Q4562935) (← links)
• (Q4667067) (← links)
• Analysis of Deterministic Control and Its Improvements for an Inventory Problem with Multiproduct Batch Differentiation (Q4969308) (← links)
• Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy (Q4994149) (← links)
• Tractable Equilibria in Sponsored Search with Endogenous Budgets (Q4994152) (← links)
• Online Allocation and Pricing: Constant Regret via Bellman Inequalities (Q5003719) (← 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)
• An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals (Q5130511) (← links)
• Online Network Revenue Management Using Thompson Sampling (Q5131540) (← links)
• Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds (Q5144789) (← 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)
• A refined deterministic linear program for the network revenue management problem with customer choice behavior (Q5503765) (← links)
• Opaque selling of multiple substitutable products with finite inventories (Q6051576) (← links)