Exact optimization and decomposition approaches for shelf space allocation

DOI10.1016/j.ejor.2021.08.047zbMath1490.90121OpenAlexW3197220340MaRDI QIDQ2077910

Mehmet A. Begen, Burcu Caglar Gencosman

Publication date: 23 February 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.08.047

zbMATH Keywords

retailingshelf space allocationmixed-integer linear programminglogic-based Benders decomposition2-stage algorithmrectangular display problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items

Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms, Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut

Uses Software

• Bonmin

Cites Work

• Unnamed Item
• The location and allocation of products and product families on retail shelves
• An exact algorithm for large unbounded knapsack problems
• Product selection and space allocation in supermarkets
• Logic-based Benders decomposition
• Multi satellites scheduling algorithm based on task merging mechanism
• Logic based Benders' decomposition for orthogonal stock cutting problems
• Joint optimization models for shelf display and inventory control considering the impact of spatial relationship on demand
• A new model and a hyper-heuristic approach for two-dimensional shelf space allocation
• Retail shelf space planning problems: a comprehensive review and classification framework
• HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry
• Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling
• Combinatorial Benders' Cuts for the Strip Packing Problem
• Logic-Based Benders Decomposition for Large-Scale Optimization
• Planning and Scheduling by Logic-Based Benders Decomposition
• Planning and Scheduling to Minimize Tardiness
• Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
• A Mathematical Model for Simultaneously Determining the Optimal Brand-Collection and Display-Area Allocation
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2004