Packing ellipsoids into volume-minimizing rectangular boxes
From MaRDI portal
Publication:506451
DOI10.1007/S10898-015-0348-6zbMATH Open1390.90444OpenAlexW1123507228MaRDI QIDQ506451FDOQ506451
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
Recommendations
global optimizationcomputational geometrypacking problemellipsoid representationnon-convex nonlinear programmingnon-overlap constraints
Cites Work
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Cutting circles and polygons from area-minimizing rectangles
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Cutting ellipses from area-minimizing rectangles
- Phi-functions for 2D objects formed by line segments and circular arcs
- Polylithic modeling and solution approaches using algebraic modeling systems
- Title not available (Why is that?)
- Geometric properties of random disk packings.
- Packing ellipsoids with overlap
- On convex relaxations of quadrilinear terms
- Title not available (Why is that?)
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Covering a polygonal region by rectangles
Cited In (14)
- Packing ellipsoids with overlap
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
- Packing circles into perimeter-minimizing convex hulls
- A nonlinear programming model with implicit variables for packing ellipsoids
- Sparse balanced layout of ellipsoids
- Optimized ellipse packings in regular polygons
- Packing ellipsoids in an optimized cylinder
- Packing ellipsoids by nonlinear optimization
- Sparse balanced layout of spherical voids in three-dimensional domains
- Digital model of natural cores using geometric design
- Packing ovals in optimized regular polygons
- Cutting ellipses from area-minimizing rectangles
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition
- Packing ellipses in an optimized convex polygon
Uses Software
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)
