Decomposition Algorithm for Irregular Placement Problems

DOI10.1007/978-3-030-33585-4_21zbMath1462.90131OpenAlexW2981648659MaRDI QIDQ5117305

No author found.

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)

Related Items (5)

Heuristics for the two-dimensional irregular bin packing problem with limited rotations ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ 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

Cites Work

• Unnamed Item
• Quasi-phi-functions and optimal packing of ellipses
• Packing ellipsoids by nonlinear optimization
• On the global minimum in a balanced circular packing problem
• Algorithms for nesting with defects
• Packing circular-like objects in a rectangular container
• The complexity of cutting complexes
• A customized branch-and-bound approach for irregular shape nesting
• Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
• Packing of concave polyhedra with continuous rotations using nonlinear optimisation
• Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
• A fully general, exact algorithm for nesting irregular shapes
• Cutting ellipses from area-minimizing rectangles
• Packing ellipses in an optimized convex polygon
• Irregular packing problems: a review of mathematical models
• Optimized packings with applications
• An improved typology of cutting and packing problems
• Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting
• Optimized Object Packings Using Quasi-Phi-Functions
• Packing equal circles into a circle with circular prohibited areas
• Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
• Solving Non-standard Packing Problems by Global Optimization and Heuristics

This page was built for publication: Decomposition Algorithm for Irregular Placement Problems