Decomposition algorithm for irregular placement problems

DOI10.1007/978-3-030-33585-4_21MaRDI QIDQ5117305zbMATH OpenOpenAlexFDO

Authors

Publication date 20 August 2020

Published in Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-33585-4_21

zbMATH Keywords

nonlinear optimizationmathematical modeldecomposition algorithmplacement problemirregular objects

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Placement problems for irregular objects: mathematical modeling, optimization and applications
• Decomposition algorithm for geometric objects in 2D packing and cutting problems
• Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
• Placement of two- and three-dimensional irregular shapes for inertia moment and balance
• Raster penetration map applied to the irregular packing problem

Cites work

• scientific article; zbMATH DE number 6698326 (Why is no real title available?)
• A customized branch-and-bound approach for irregular shape nesting
• A fully general, exact algorithm for nesting irregular shapes
• Algorithms for nesting with defects
• An improved typology of cutting and packing problems
• Approximate packing: integer programming models, valid inequalities and nesting
• Cutting ellipses from area-minimizing rectangles
• Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
• Irregular packing problems: a review of mathematical models
• Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
• Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
• On the global minimum in a balanced circular packing problem
• Optimized object packings using quasi-phi-functions
• Optimized packings with applications
• Packing circular-like objects in a rectangular container
• Packing ellipses in an optimized convex polygon
• Packing ellipsoids by nonlinear optimization
• Packing equal circles into a circle with circular prohibited areas
• Packing of concave polyhedra with continuous rotations using nonlinear optimisation
• Quasi-phi-functions and optimal packing of ellipses
• Solving Non-standard Packing Problems by Global Optimization and Heuristics
• The complexity of cutting complexes

Cited in

(9)

• scientific article; zbMATH DE number 569959 (Why is no real title available?)
• Proportional packing of circles in a circular container
• Sparsest balanced packing of irregular 3D objects in a cylindrical container
• Optimized filling of a given cuboid with spherical powders for additive manufacturing
• Packing spheres with quasi-containment conditions
• Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
• Placement of two- and three-dimensional irregular shapes for inertia moment and balance
• Heuristics for the two-dimensional irregular bin packing problem with limited rotations
• Placement problems for irregular objects: mathematical modeling, optimization and applications

This page was built for publication: Decomposition algorithm for irregular placement problems

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