Packing ellipsoids into volume-minimizing rectangular boxes

DOI10.1007/s10898-015-0348-6zbMath1390.90444OpenAlexW1123507228MaRDI QIDQ506451

Josef Kallrath

Publication date: 1 February 2017

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

Full work available at URL: https://doi.org/10.1007/s10898-015-0348-6

zbMATH Keywords

global optimizationpacking problemcomputational geometryellipsoid representationnon-convex nonlinear programmingnon-overlap constraints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Related Items (12)

Packing ellipsoids by nonlinear optimization ⋮ A nonlinear programming model with implicit variables for packing ellipsoids ⋮ Packing ovals in optimized regular polygons ⋮ Sparse balanced layout of ellipsoids ⋮ Packing ellipsoids in an optimized cylinder ⋮ Packing circles into perimeter-minimizing convex hulls ⋮ Digital model of natural cores using geometric design ⋮ A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids ⋮ Packing ellipses in an optimized convex polygon ⋮ Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition ⋮ Sparse balanced layout of spherical voids in three-dimensional domains ⋮ Optimized ellipse packings in regular polygons

Uses Software

• LINDO
• GAMS
• ANTIGONE

Cites Work

• Unnamed Item
• Unnamed Item
• Phi-functions for 2D objects formed by line segments and circular arcs
• Covering a polygonal region by rectangles
• Polylithic modeling and solution approaches using algebraic modeling systems
• Packing cylinders and rectangular parallelepipeds with distances between them into a given region
• Cutting circles and polygons from area-minimizing rectangles
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• On convex relaxations of quadrilinear terms
• Geometric properties of random disk packings.
• Cutting ellipses from area-minimizing rectangles
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Packing Ellipsoids with Overlap

This page was built for publication: Packing ellipsoids into volume-minimizing rectangular boxes