A piecewise linearization for retail shelf space allocation problem and a local search heuristic
From MaRDI portal
Publication:610971
DOI10.1007/s10479-008-0455-6zbMath1201.90136OpenAlexW2061925581MaRDI QIDQ610971
Hasmukh K. Gajjar, Gajendra Kumar Adil
Publication date: 13 December 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0455-6
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A genetic algorithm for the retail shelf space allocation problem with virtual segments ⋮ Retail store operations: literature review and research directions ⋮ Heuristics for the shelf space allocation problem ⋮ Unnamed Item ⋮ Joint decisions on product line selection, purchasing, and pricing ⋮ Retail shelf space planning problems: a comprehensive review and classification framework
Cites Work
- Unnamed Item
- Unnamed Item
- 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 piecewise linearization framework for retail shelf space management models
- A Model for Fresh Produce Shelf-Space Allocation and Inventory Management with Freshness-Condition-Dependent Demand
- Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation
- On the Value of Binary Expansions for General Mixed-Integer Linear Programs
- A Branch-and-Bound Method for Reversed Geometric Programming
- 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 piecewise linearization for retail shelf space allocation problem and a local search heuristic
