The Discrete Two-Dimensional Assortment Problem
From MaRDI portal
Publication:3783805
DOI10.1287/opre.36.2.324zbMath0642.90031OpenAlexW1993459650MaRDI QIDQ3783805
Publication date: 1988
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.36.2.324
heuristic solutioncombined stocking and substitution costsoptimal stocking patterntwo-dimensional assortment
Related Items
Efficient reformulations for dynamic lot-sizing problems with product substitution ⋮ A classification of the literature on the planning of substitutable products ⋮ A co-opetitive newsvendor model with product substitution and a wholesale price contract ⋮ Neighborhood search heuristics for the uncapacitated facility location problem ⋮ Branch and peg algorithms for the simple plant location problem. ⋮ Solution to the assortment problem via the genetic algorithm ⋮ Unnamed Item ⋮ Branch and peg algorithms for the simple plant location problem ⋮ A comparison of solution methods for the assortment problem ⋮ Optimizing product assortment under customer-driven demand substitution ⋮ Stock selection heuristics for interdependent items
