A modeling-based approach for non-standard packing problems

DOI10.1007/978-3-319-18899-7_4MaRDI QIDQ4634972zbMATH OpenOpenAlexFDO

Authors Giorgio Fasano

Publication date 13 April 2018

Published in Optimized Packings with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18899-7_4

zbMATH Keywords

additional/balancing conditionsconvex domainefficient formulationfeasibility sub-problemglobal optimization (GO)heuristicsmixed integer linear/nonlinear programming modelsorthogonal packingpolygon approximationspace-indexed/grid-based-position paradigmstetris-like items

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Combinatorial optimization (90C27) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Recommendations

• A global optimization point of view to handle non-standard object packing problems
• Solving Non-standard Packing Problems by Global Optimization and Heuristics
• Modeling of packing problems
• scientific article; zbMATH DE number 2050783
• A MIP approach for some practical packing problems: balancing constraints and tetris-like items

Cites work

• A container loading problem MILP-based heuristics solved by CPLEX: an experimental analysis
• A unified theory for metric regularity of multifunctions
• An Analysis of the Total Least Squares Problem
• An analytical model for the container loading problem
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• An improved typology of cutting and packing problems
• Editorial: Total least squares and errors-in-variables modeling
• Fast neighborhood search for two- and three-dimensional nesting problems
• Optimization models for the three-dimensional container loading problem with practical constraints
• Packing cylinders and rectangular parallelepipeds with distances between them into a given region
• Solving Non-standard Packing Problems by Global Optimization and Heuristics

Cited in

(12)

• Configuration space of geometric objects
• A MIP approach for some practical packing problems: balancing constraints and tetris-like items
• A global optimization point of view to handle non-standard object packing problems
• Sparsest balanced packing of irregular 3D objects in a cylindrical container
• Formalizing spatial configuration optimization problems with the use of a special function class
• Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
• Models of the nonguillotine sheet and strip rectangular packing problem
• A new nonlinear model for the two-dimensional rectangle packing problem
• Packing problems in space solved by CPLEX: an experimental analysis
• Modeling of packing problems
• scientific article; zbMATH DE number 2050783 (Why is no real title available?)
• Solving Non-standard Packing Problems by Global Optimization and Heuristics

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A modeling-based approach for non-standard packing problems

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