A General Purpose Algorithm for Three-Dimensional Packing

DOI10.1287/ijoc.1030.0068zbMath1239.90108OpenAlexW2105183094MaRDI QIDQ2890477

Philippe Grégoire, Lorenzo Brunetta

Publication date: 8 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c31190091cefa29edb079ea7762fe018623bfb4e

zbMATH Keywords

integer programmingheuristic algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (8)

A cost-efficient method to optimize package size in emerging markets ⋮ A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems ⋮ Space and time allocation in a shipyard assembly hall ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Lower bounds for three-dimensional multiple-bin-size bin 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 ⋮ Constraints in container loading -- a state-of-the-art review

This page was built for publication: A General Purpose Algorithm for Three-Dimensional Packing