A DYNAMIC PROGRAMMING HEURISTIC FOR RETAIL SHELF SPACE ALLOCATION PROBLEM
From MaRDI portal
Publication:2998842
DOI10.1142/S0217595911003120zbMath1211.90111OpenAlexW2041024532MaRDI QIDQ2998842
Hasmukh K. Gajjar, Gajendra Kumar Adil
Publication date: 11 May 2011
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595911003120
Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Related Items (2)
Retail shelf space planning problems: a comprehensive review and classification framework ⋮ An application of approximate dynamic programming in multi-period multi-product advertising budgeting
Cites Work
- A joint optimisation model for inventory replenishment, product assortment, shelf space and display area allocation decisions
- Goal programming model for grocery shelf space allocation
- Product selection and space allocation in supermarkets
- A minimal algorithm for the multiple-choice knapsack problem
- A Mathematical Model for Simultaneously Determining the Optimal Brand-Collection and Display-Area Allocation
- An efficient algorithm to allocate shelf space
This page was built for publication: A DYNAMIC PROGRAMMING HEURISTIC FOR RETAIL SHELF SPACE ALLOCATION PROBLEM