An efficient algorithm to allocate shelf space
From MaRDI portal
Publication:5937352
DOI10.1016/S0377-2217(99)00448-8zbMath0979.90083OpenAlexW2056802862WikidataQ126803271 ScholiaQ126803271MaRDI QIDQ5937352
Publication date: 12 July 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00448-8
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (23)
A genetic algorithm for the retail shelf space allocation problem with virtual segments ⋮ Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions ⋮ Shelf-space allocation of national and private brands ⋮ Goal programming model for grocery shelf space allocation ⋮ A piecewise linearization framework for retail shelf space management models ⋮ The location and allocation of products and product families on retail shelves ⋮ A piecewise linearization for retail shelf space allocation problem and a local search heuristic ⋮ A model and case study for efficient shelf usage and assortment analysis ⋮ Product assortment and space allocation strategies to attract loyal and non-loyal customers ⋮ A new model and a hyper-heuristic approach for two-dimensional shelf space allocation ⋮ Unnamed Item ⋮ An optimization model for product placement on product listing pages ⋮ A DYNAMIC PROGRAMMING HEURISTIC FOR RETAIL SHELF SPACE ALLOCATION PROBLEM ⋮ SHELF-SPACE ALLOCATION AND ADVERTISING DECISIONS IN THE MARKETING CHANNEL: A DIFFERENTIAL GAME APPROACH ⋮ Private labels and retail assortment planning: a differential evolution approach ⋮ Joint optimization models for shelf display and inventory control considering the impact of spatial relationship on demand ⋮ A fuzzy goal programming approach for mid-term assortment planning in supermarkets ⋮ Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves ⋮ Retail shelf space planning problems: a comprehensive review and classification framework ⋮ Shelf space dimensioning and product allocation in retail stores ⋮ A practical approach to the shelf-space allocation and replenishment problem with heterogeneously sized shelves ⋮ A shelf-space-dependent wholesale price when manufacturer and retailer brands compete ⋮ A time-consistent open-loop Stackelberg equilibrium of shelf-space allocation
Cites Work
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- Product selection and space allocation in supermarkets
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A Branch-and-Bound Method for Reversed Geometric Programming
- Parametric Solution for Linear Bicriteria Knapsack Models
- Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
- A Mathematical Model for Simultaneously Determining the Optimal Brand-Collection and Display-Area Allocation
This page was built for publication: An efficient algorithm to allocate shelf space
