A dynamic programming heuristic for retail shelf space allocation problem
From MaRDI portal
Recommendations
- An efficient algorithm to allocate shelf space
- A piecewise linearization for retail shelf space allocation problem and a local search heuristic
- Heuristic and meta-heuristic approaches for multi-period shelf-space optimization: the case of motion picture retailing
- Shelf space dimensioning and product allocation in retail stores
- Exact optimization and decomposition approaches for shelf space allocation
Cites work
- A joint optimisation model for inventory replenishment, product assortment, shelf space and display area allocation decisions
- A Mathematical Model for Simultaneously Determining the Optimal Brand-Collection and Display-Area Allocation
- A minimal algorithm for the multiple-choice knapsack problem
- An efficient algorithm to allocate shelf space
- Goal programming model for grocery shelf space allocation
- Product selection and space allocation in supermarkets
Cited in
(7)- Retail shelf space planning problems: a comprehensive review and classification framework
- An application of approximate dynamic programming in multi-period multi-product advertising budgeting
- Heuristic and meta-heuristic approaches for multi-period shelf-space optimization: the case of motion picture retailing
- An efficient algorithm to allocate shelf space
- A piecewise linearization for retail shelf space allocation problem and a local search heuristic
- Flower-cutting heuristics for shelf space allocation problem with simultaneous vertical and horizontal product categorization on the retail store shelves
- Goal programming model for grocery shelf space allocation
This page was built for publication: A dynamic programming heuristic for retail shelf space allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2998842)
