A global optimization point of view to handle non-standard object packing problems

DOI10.1007/s10898-012-9865-8zbMath1268.90062OpenAlexW2073302503MaRDI QIDQ1941035

Giorgio Fasano

Publication date: 11 March 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-012-9865-8

zbMATH Keywords

non-rectangular domainspolygon packingMIP/MINLPtetris-like item packing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items

Two approaches to modeling and solving the packing problem for convex polytopes, Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem, Configuration space of geometric objects, Multistage approach to solving the optimization problem of packing nonconvex polyhedra, Optimized Object Packings Using Quasi-Phi-Functions, Packing of concave polyhedra with continuous rotations using nonlinear optimisation, Packing different cuboids with rotations and spheres into a cuboid, Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives, Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints

Uses Software

• COIN-OR
• SAP APO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global optimization. From theory to implementation.
• Solving circle packing problems by global optimization: numerical results and industrial applications
• MIP-based heuristic for non-standard 3D-packing problems
• Column enumeration based decomposition techniques for a class of non-convex MINLP problems
• Cutting circles and polygons from area-minimizing rectangles
• S3 sets. An extension of the Beale-Tomlin special ordered sets
• An analytical model for the container loading problem
• A collection of test problems for constrained global optimization algorithms
• Handbook of test problems in local and global optimization
• \(\Phi\)-functions for complex 2D-objects
• A MIP approach for some practical packing problems: balancing constraints and tetris-like items
• Mixed-integer programming models for nesting problems
• The two-dimensional bin packing problem with variable bin sizes and costs
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• Jostling for position: local improvement for irregular cutting patterns
• Solving large-scale mixed-integer programs with fixed charge variables
• The Three-Dimensional Bin Packing Problem
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing