.png){kind=icon}
.png){kind=icon}
Return
An efficient algorithm for large-scale dynamic assortment planning problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2025.09.017.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Assortment planning with dynamic or stockout-based substitution. • Maximize revenue subject to capacity constraint on the total inventory. • Efficient heuristic for large-scale problems faced by e-retailers. • Ranking-based choice model is used with no assumptions on the substitution pattern. • Our heuristic yields fast, high-quality results in extensive numerical experiments.
Keywords:
Heuristics
Assortment planning
Dynamic substitution
Submodularity
Greedy
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available