A MIP approach for some practical packing problems: balancing constraints and tetris-like items

DOI10.1007/S10288-004-0037-7zbMATH Open1057.90054OpenAlexW2000737217MaRDI QIDQ1885342FDOQ1885342

Authors Giorgio Fasano 

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

zbMATH Keywords

mixed integer programmingPackingbalancing conditionsMIP-based heuristic approachtetris-like items

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Combinatorial aspects of packing and covering (05B40)

Recommendations

• scientific article; zbMATH DE number 2050783
• Packing problems in space solved by CPLEX: an experimental analysis
• MIP-based heuristic for non-standard 3D-packing problems
• A global optimization point of view to handle non-standard object packing problems
• A modeling-based approach for non-standard packing problems

Cited In (19)

• A global optimization point of view to handle non-standard object packing problems
• A fast heuristic for a three-dimensional non-convex domain loading problem
• How fast can we play Tetris greedily with rectangular pieces?
• Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
• Packing problems in space solved by CPLEX: an experimental analysis
• CAST: a successful project in support of the international space station logistics
• A large neighbourhood search algorithm for solving container loading problems
• A new load balance methodology for container loading problem in road transportation
• A novel non-linear approach to minimal area rectangular packing
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• Data structures for higher-dimensional rectilinear packing
• MIP-based heuristic for non-standard 3D-packing problems
• A data-driven approach for mixed-case palletization with support
• Placement of two- and three-dimensional irregular shapes for inertia moment and balance
• The three-dimensional knapsack problem with balancing constraints
• Exploiting packing components in general-purpose integer programming solvers
• Packing convex 3D objects with special geometric and balancing conditions
• A modeling-based approach for non-standard packing problems
• Title not available (Why is no real title available?)

This page was built for publication: A MIP approach for some practical packing problems: balancing constraints and tetris-like items

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885342)