Quasi-phi-functions and optimal packing of ellipses
From MaRDI portal
Publication:288226
DOI10.1007/s10898-015-0331-2zbMath1369.90151OpenAlexW2199861121MaRDI QIDQ288226
F. Blanchet-Sadri, M. Dambrine
Publication date: 25 May 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0331-2
nonlinear optimizationmathematical modeldistance constraintsellipse packingnon-overlappingobject continuous rotationsquasi-phi-functions
Related Items
Two approaches to modeling and solving the packing problem for convex polytopes, Packing ellipsoids by nonlinear optimization, A nonlinear programming model with implicit variables for packing ellipsoids, Sparse balanced layout of ellipsoids, Packing ellipsoids in an optimized cylinder, Packing convex polygons in minimum-perimeter convex hulls, Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts, Decomposition Algorithm for Irregular Placement Problems, Packing Convex 3D Objects with Special Geometric and Balancing Conditions, \( \Phi \)-functions of 2D objects with boundaries being second-order curves, Optimized Object Packings Using Quasi-Phi-Functions, The method of artificial space dilation in problems of optimal packing of geometric objects, A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids, Packing of concave polyhedra with continuous rotations using nonlinear optimisation, Packing ellipses in an optimized convex polygon, Combinatorial configurations in balance layout optimization problems, Sparsest balanced packing of irregular 3D objects in a cylindrical container, Irregular packing problems: a review of mathematical models, Near optimal minimal convex hulls of disks, Optimized packing clusters of objects in a rectangular container, Packing a fixed number of identical circles in a circular container with circular prohibited areas, Optimized ellipse packings in regular polygons, Packing Problems in Space Solved by CPLEX: An Experimental Analysis, Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
Uses Software
Cites Work
- Unnamed Item
- Packing congruent hyperspheres into a hypersphere
- Phi-functions for 2D objects formed by line segments and circular arcs
- Tools of mathematical modeling of arbitrary object packing problems
- Cutting circles and polygons from area-minimizing rectangles
- The complexity of cutting complexes
- Disk packing for the estimation of the size of a wire bundle
- Two-dimensional packing problems: a survey
- Optimal clustering of a pair of irregular objects
- Cutting ellipses from area-minimizing rectangles
- Mathematical modeling of the interaction of non-oriented convex polytopes
- Mathematical model and efficient algorithms for object packing problem
- The geometry of nesting problems: a tutorial
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- An improved typology of cutting and packing problems
- Irregular Packing Using the Line and Arc No-Fit Polygon
- TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS
