Determining the Minimum Number of Warehouses and their Space-Size for Storing Compatible Items

DOI10.1007/978-1-4614-5134-1_13zbMath1375.90158OpenAlexW1011537043MaRDI QIDQ4596164

Stefanos Katsavounis, Dimitra Alexiou

Publication date: 30 November 2017

Published in: Optimization Theory, Decision Making, and Operations Research Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-5134-1_13

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)

Related Items (1)

Generating the family of all traffic signal light cycles coordinated with pedestrian crosswalks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New lower bounds for bin packing problems with conflicts
• Heuristics and lower bounds for the bin packing problem with conflicts
• Algorithms for the Bin Packing Problem with Conflicts
• A survey on vertex coloring problems
• Heuristics for determining the number of warehouses for storing non-compatible products

This page was built for publication: Determining the Minimum Number of Warehouses and their Space-Size for Storing Compatible Items