A MIP approach for some practical packing problems: balancing constraints and tetris-like items
From MaRDI portal
Publication:1885342
DOI10.1007/s10288-004-0037-7zbMath1057.90054MaRDI QIDQ1885342
Publication date: 28 October 2004
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-004-0037-7
Packing; mixed integer programming; balancing conditions; MIP-based heuristic approach; tetris-like items
90C11: Mixed integer programming
90C59: Approximation methods and heuristics in mathematical programming
05B40: Combinatorial aspects of packing and covering
Related Items
Exploiting Packing Components in General-Purpose Integer Programming Solvers, A large neighbourhood search algorithm for solving container loading problems, How fast can we play Tetris greedily with rectangular pieces?, The three-dimensional knapsack problem with balancing constraints, A fast heuristic for a three-dimensional non-convex domain loading problem, A novel non-linear approach to minimal area rectangular packing, MIP-based heuristic for non-standard 3D-packing problems, A new load balance methodology for container loading problem in road transportation, A global optimization point of view to handle non-standard object packing problems, Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems, Practical constraints in the container loading problem: comprehensive formulations and exact algorithm, A data-driven approach for mixed-case palletization with support, Data Structures for Higher-Dimensional Rectilinear Packing, Placement of two- and three-dimensional irregular shapes for inertia moment and balance
