Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand

DOI10.1287/opre.2015.1450zbMath1336.90049OpenAlexW290320431MaRDI QIDQ2806071

Vineet Goyal, Danny Segev, Retsef Levi

Publication date: 13 May 2016

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2015.1450

zbMATH Keywords

assortment planningpolynomial time approximation schemesdynamic substitution

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Management decision making, including multiple objectives (90B50) Inventory, storage, reservoirs (90B05)

Related Items (17)

Joint assortment and inventory optimization for vertically differentiated products under consumer-driven substitution ⋮ Which strategy is better for managing multi-product demand uncertainty: inventory substitution or probabilistic selling? ⋮ Robust assortment optimization under sequential product unavailability ⋮ An optimal stocking problem to minimize the expected time to sellout ⋮ Retail store operations: literature review and research directions ⋮ Inventory management under price-based and stockout-based substitution ⋮ The Approximability of Assortment Optimization Under Ranking Preferences ⋮ A branch-and-cut algorithm for the latent-class logit assortment problem ⋮ Capacitated strategic assortment planning under explicit demand substitution ⋮ Assortment planning with nested preferences: dynamic programming with distributions as states? ⋮ A review of choice-based revenue management: theory and methods ⋮ An exact method for assortment optimization under the nested logit model ⋮ The Multiproduct Newsvendor Problem with Customer Choice ⋮ Technical Note—Capacitated Assortment Optimization Under the Multinomial Logit Model with Nested Consideration Sets ⋮ Approximation Algorithms for Dynamic Assortment Optimization Models ⋮ Technical Note—Multiproduct Inventory Management Under Customer Substitution and Capacity Restrictions ⋮ Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences

Cites Work

• Unnamed Item
• Unnamed Item
• A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
• Optimal ordering decisions for two substitutable products with stochastic demands
• Bin packing can be solved within 1+epsilon in linear time
• A quasi-PTAS for unsplittable flow on line graphs
• Assortment Planning and Inventory Decisions Under Stockout-Based Substitution
• Assortment Planning and Inventory Decisions Under a Locational Choice Model
• Inventory Models for Substitutable Products: Optimal Policies and Heuristics
• A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
• Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
• Revenue Management Under a General Discrete Choice Model of Consumer Behavior
• Stocking Retail Assortments Under Dynamic Consumer Substitution
• Centralized and Competitive Inventory Models with Demand Substitution
• The Assortment Problem with Probabilistic Demands
• Management of Multi-Item Retail Inventory Systems with Demand Substitution
• On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
• A quasi-polynomial time approximation scheme for minimum weight triangulation

This page was built for publication: Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand