A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice
From MaRDI portal
Publication:2884320
DOI10.1287/moor.1120.0537zbMath1243.90234OpenAlexW1986352749MaRDI QIDQ2884320
Publication date: 24 May 2012
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d8037db77ae9874b797608443fb630777f648e08
Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36) Markov and semi-Markov decision processes (90C40)
Related Items (23)
Asymptotically optimal dynamic pricing for network revenue management ⋮ Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds ⋮ Constant Regret Resolving Heuristics for Price-Based Revenue Management ⋮ Performance of an LP-Based Control for Revenue Management with Unknown Demand Parameters ⋮ A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice ⋮ Model Predictive Control for Dynamic Resource Allocation ⋮ Dynamic pricing and replenishment: Optimality, bounds, and asymptotics ⋮ Opaque selling of multiple substitutable products with finite inventories ⋮ Technical Note—A Near-Optimal Algorithm for Real-Time Order Acceptance: An Application in Postacute Healthcare Services ⋮ Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources ⋮ Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards ⋮ Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements ⋮ An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals ⋮ Online Network Revenue Management Using Thompson Sampling ⋮ Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds ⋮ Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios ⋮ A review of choice-based revenue management: theory and methods ⋮ An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment ⋮ Analysis of Deterministic Control and Its Improvements for an Inventory Problem with Multiproduct Batch Differentiation ⋮ Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy ⋮ Tractable Equilibria in Sponsored Search with Endogenous Budgets ⋮ Online Allocation and Pricing: Constant Regret via Bellman Inequalities ⋮ On bid-price controls for network revenue management
This page was built for publication: A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice
