The inventory packing problem

DOI<399::AID-NAV3220360406>3.0.CO;2-M 10.1002/1520-6750(198908)36:4<399::AID-NAV3220360406>3.0.CO;2-MzbMath0672.90032OpenAlexW2043654534MaRDI QIDQ3826323

Nicholas G. Hall

Publication date: 1989

Full work available at URL: https://doi.org/10.1002/1520-6750(198908)36:4<399::aid-nav3220360406>3.0.co;2-m

zbMATH Keywords

heuristicsworst-case performanceNP completebin-packingcomputational testinginventory-packing problemminimum number of identical storage areas

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Related Items (1)

A Comparison of Inventory Replenishment Heuristics for Minimizing Maximum Storage

Cites Work

• A Comparison of Inventory Replenishment Heuristics for Minimizing Maximum Storage
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The inventory packing problem