An efficient algorithm to allocate shelf space
From MaRDI portal
Publication:5937352
DOI10.1016/S0377-2217(99)00448-8zbMath0979.90083WikidataQ126803271 ScholiaQ126803271MaRDI QIDQ5937352
Publication date: 12 July 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C59: Approximation methods and heuristics in mathematical programming
90B80: Discrete location and assignment
Related Items
SHELF-SPACE ALLOCATION AND ADVERTISING DECISIONS IN THE MARKETING CHANNEL: A DIFFERENTIAL GAME APPROACH, A fuzzy goal programming approach for mid-term assortment planning in supermarkets, 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, A time-consistent open-loop Stackelberg equilibrium of shelf-space allocation, Shelf-space allocation of national and private brands, Goal programming model for grocery shelf space allocation, A shelf-space-dependent wholesale price when manufacturer and retailer brands compete, A piecewise linearization framework for retail shelf space management models, A new model and a hyper-heuristic approach for two-dimensional shelf space allocation, A DYNAMIC PROGRAMMING HEURISTIC FOR RETAIL SHELF SPACE ALLOCATION PROBLEM
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
