Packing ellipsoids into volume-minimizing rectangular boxes

DOI10.1007/S10898-015-0348-6MaRDI QIDQ506451zbMATH OpenOpenAlexFDO

Authors 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 optimizationcomputational geometrypacking problemellipsoid representationnon-convex nonlinear programmingnon-overlap constraints

Mathematics Subject Classification ID

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

Recommendations

• Packing ellipsoids in an optimized cylinder
• Packing ellipsoids by nonlinear optimization
• A nonlinear programming model with implicit variables for packing ellipsoids
• A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
• Packing ellipsoids with overlap

Cites work

• scientific article; zbMATH DE number 3451986 (Why is no real title available?)
• scientific article; zbMATH DE number 3018666 (Why is no real title available?)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Covering a polygonal region by rectangles
• Cutting circles and polygons from area-minimizing rectangles
• Cutting ellipses from area-minimizing rectangles
• Geometric properties of random disk packings.
• On convex relaxations of quadrilinear terms
• Packing cylinders and rectangular parallelepipeds with distances between them into a given region
• Packing ellipsoids with overlap
• Phi-functions for 2D objects formed by line segments and circular arcs
• Polylithic modeling and solution approaches using algebraic modeling systems

Cited in

(14)

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

Describes a project that uses

Uses Software

• LINDO
• GAMS
• ANTIGONE

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

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