The Discrete Two-Dimensional Assortment Problem
From MaRDI portal
Recommendations
Cited in
(16)- A two-dimensional sideways problem with random discrete data
- Metaheuristics for assortment problems with multiple quality levels
- A dynamic programming based heuristic for industrial buying of cardboard
- Neighborhood search heuristics for the uncapacitated facility location problem
- Branch and peg algorithms for the simple plant location problem
- Stock selection heuristics for interdependent items
- A comparison of solution methods for the assortment problem
- A classification of the literature on the planning of substitutable products
- Optimal assortment with concave cost functions
- Optimizing product assortment under customer-driven demand substitution
- A spreadsheet modelling approach to the assortment problem
- A co-opetitive newsvendor model with product substitution and a wholesale price contract
- Solution to the assortment problem via the genetic algorithm
- Efficient reformulations for dynamic lot-sizing problems with product substitution
- Branch and peg algorithms for the simple plant location problem.
- scientific article; zbMATH DE number 1310285 (Why is no real title available?)
This page was built for publication: The Discrete Two-Dimensional Assortment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783805)