Packing small boxes into a big box.
From MaRDI portal
Publication:1403159
DOI10.1007/S001860000066zbMath1038.90066OpenAlexW2053105805MaRDI QIDQ1403159
Publication date: 2000
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001860000066
cutting planesmixed-integer programmingpolyhedral combinatoricsthree-dimensional packingfacet of polyhedra
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (22)
A global optimization approach for solving three-dimensional open dimension rectangular packing problems ⋮ A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem ⋮ VCS: A new heuristic function for selecting boxes in the single container loading problem ⋮ Exact and approximate methods for parallel multiple-area spatial scheduling with release times ⋮ A novel hybrid tabu search approach to container loading ⋮ A beam search algorithm for the biobjective container loading problem ⋮ A model‐based heuristic to the vehicle routing and loading problem ⋮ Оптимизация загрузки упорядоченной совокупности летательных аппаратов ⋮ A space-indexed formulation of packing boxes into a larger box ⋮ Exploiting Packing Components in General-Purpose Integer Programming Solvers ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ A fast heuristic for a three-dimensional non-convex domain loading problem ⋮ A particular approach for the three-dimensional packing problem with additional constraints ⋮ Mixed-integer programming models for nesting problems ⋮ Consecutive ones matrices for multi-dimensional orthogonal packing problems ⋮ A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application ⋮ A comparative review of 3D container loading algorithms ⋮ The maximum diversity assortment selection problem ⋮ Data Structures for Higher-Dimensional Rectilinear Packing ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ Optimal aircraft load balancing ⋮ Constraints in container loading -- a state-of-the-art review
This page was built for publication: Packing small boxes into a big box.
