Optimized object packings using quasi-phi-functions
From MaRDI portal
Recommendations
- Quasi-phi-functions and optimal packing of ellipses
- Two approaches to modeling and solving the packing problem for convex polytopes
- Tools of mathematical modeling of arbitrary object packing problems
- Optimized packing clusters of objects in a rectangular container
- Packing different cuboids with rotations and spheres into a cuboid
Cites work
- A global optimization point of view to handle non-standard object packing problems
- A literature review on circle and sphere packing problems: models and methodologies
- An improved typology of cutting and packing problems
- Cutting circles and polygons from area-minimizing rectangles
- Cutting ellipses from area-minimizing rectangles
- Fast neighborhood search for two- and three-dimensional nesting problems
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
- Irregular packing using the line and arc no-fit polygon
- Mathematical model and efficient algorithms for object packing problem
- Mathematical modeling of the interaction of non-oriented convex polytopes
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Maximum packing densities of basic 3D objects
- MIP-based heuristic for non-standard 3D-packing problems
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimal clustering of a pair of irregular objects
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Packing different cuboids with rotations and spheres into a cuboid
- Phi-functions for 2D objects formed by line segments and circular arcs
- Quasi-phi-functions and optimal packing of ellipses
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- The complexity of cutting complexes
- Tools of mathematical modeling of arbitrary object packing problems
- Translational packing of arbitrary polytopes
Cited in
(23)- Two approaches to modeling and solving the packing problem for convex polytopes
- Configuration space of geometric objects
- Sparsest balanced packing of irregular 3D objects in a cylindrical container
- Optimized filling of a given cuboid with spherical powders for additive manufacturing
- Parallel computing technologies for solving optimization problems of geometric design
- Packing ellipsoids in an optimized cylinder
- Mathematical model and efficient algorithms for object packing problem
- Packing ellipses in an optimized convex polygon
- Formalizing spatial configuration optimization problems with the use of a special function class
- Irregular packing problems: a review of mathematical models
- Optimized packing clusters of objects in a rectangular container
- Optimized ellipse packings in regular polygons
- A nonlinear programming model with implicit variables for packing ellipsoids
- Quasi-phi-functions and optimal packing of ellipses
- Packing problems in space solved by CPLEX: an experimental analysis
- Phi-functions for 2D objects formed by line segments and circular arcs
- Decomposition algorithm for irregular placement problems
- Packing convex 3D objects with special geometric and balancing conditions
- Optimal balanced packing using phi-function technique
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Tools of mathematical modeling of arbitrary object packing problems
- The concept of modeling packing and covering problems using modern computational geometry software
- Scalable enforcement of geometric non-interference constraints for gradient-based optimization
This page was built for publication: Optimized object packings using quasi-phi-functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634983)
