Quasi-phi-functions and optimal packing of ellipses
From MaRDI portal
Publication:288226
DOI10.1007/S10898-015-0331-2zbMATH Open1369.90151OpenAlexW2199861121MaRDI QIDQ288226FDOQ288226
Authors: Yu. Stoyan, A. Pankratov, T. Romanova 
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
Recommendations
- Optimized object packings using quasi-phi-functions
- Packing ellipses in an optimized convex polygon
- Phi-functions for 2D objects formed by line segments and circular arcs
- Two approaches to modeling and solving the packing problem for convex polytopes
- Tools of mathematical modeling of arbitrary object packing problems
nonlinear optimizationmathematical modeldistance constraintsellipse packingnon-overlappingobject continuous rotationsquasi-phi-functions
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Mathematical model and efficient algorithms for object packing problem
- The geometry of nesting problems: a tutorial
- An improved typology of cutting and packing problems
- 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
- Construction of a \(\Phi\)-function free of radicals for a ball and a non-oriented polytope
- Irregular packing using the line and arc no-fit polygon
- Packing congruent hyperspheres into a hypersphere
- Phi-functions for 2D objects formed by line segments and circular arcs
- Two approximate Minkowski sum algorithms
Cited In (27)
- Quasi-phi-functions for a mathematical modeling of the relations of geometric objects
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Near optimal minimal convex hulls of disks
- \( \Phi \)-functions of 2D objects with boundaries being second-order curves
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
- Combinatorial configurations in balance layout optimization problems
- Packing problems in space solved by CPLEX: an experimental analysis
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- A nonlinear programming model with implicit variables for packing ellipsoids
- Sparse balanced layout of ellipsoids
- Optimized object packings using quasi-phi-functions
- Optimized ellipse packings in regular polygons
- Optimal balanced packing using phi-function technique
- Phi-functions for 2D objects formed by line segments and circular arcs
- Packing ellipsoids in an optimized cylinder
- Optimized packing clusters of objects in a rectangular container
- Decomposition algorithm for irregular placement problems
- Sparsest balanced packing of irregular 3D objects in a cylindrical container
- Packing convex polygons in minimum-perimeter convex hulls
- Packing ellipsoids by nonlinear optimization
- Irregular packing problems: a review of mathematical models
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Packing ellipses in an optimized convex polygon
- Packing convex 3D objects with special geometric and balancing conditions
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- Two approaches to modeling and solving the packing problem for convex polytopes
- The method of artificial space dilation in problems of optimal packing of geometric objects
Uses Software
This page was built for publication: Quasi-phi-functions and optimal packing of ellipses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288226)
