Packing convex polygons in minimum-perimeter convex hulls
From MaRDI portal
Publication:2679237
Recommendations
- scientific article; zbMATH DE number 1786500
- Two approaches to modeling and solving the packing problem for convex polytopes
- Packing circles into perimeter-minimizing convex hulls
- Near optimal minimal convex hulls of disks
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
Cites work
- A fully general, exact algorithm for nesting irregular shapes
- A hybrid LP/NLP paradigm for global optimization relaxations
- A polyhedral branch-and-cut approach to global optimization
- A tutorial in irregular shape packing problems
- Aligning two convex figures to minimize area or perimeter
- An improved typology of cutting and packing problems
- Approximating minimum-area rectangular and convex containers for packing convex polygons
- Bundling three convex polygons to minimize area or perimeter
- Combinatorial configurations in balance layout optimization problems
- Computational geometry. Algorithms and applications.
- Cutting circles and polygons from area-minimizing rectangles
- How good are convex hull algorithms?
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- Introduction to algorithms
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Irregular packing problems: a review of mathematical models
- Lagrangian heuristic for a class of the generalized assignment problems
- Localization of the optimal solution and a posteriori bounds for aggregation
- Logistic constraints in container loading problems: the impact of complete shipment conditions
- Mathematical model and efficient algorithms for object packing problem
- Minimal surface convex hulls of spheres
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
- Modeling and optimization in space engineering. State of the art and new challenges
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimal clustering of a pair of irregular objects
- Optimal packing of general ellipses in a circle
- Optimized ellipse packings in regular polygons
- Packing circles into perimeter-minimizing convex hulls
- Packing ellipses in an optimized convex polygon
- Packing ellipsoids in an optimized cylinder
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- Packing ovals in optimized regular polygons
- Placement problems for irregular objects: mathematical modeling, optimization and applications
- Quasi-phi-functions and optimal packing of ellipses
- Solving Non-standard Packing Problems by Global Optimization and Heuristics
- The geometry of nesting problems: a tutorial
Cited in
(11)- Polytopes, permutation shapes and bin packing
- Near optimal minimal convex hulls of disks
- Packing ovals in optimized regular polygons
- Packing circles into perimeter-minimizing convex hulls
- scientific article; zbMATH DE number 6698326 (Why is no real title available?)
- scientific article; zbMATH DE number 1234829 (Why is no real title available?)
- scientific article; zbMATH DE number 1786500 (Why is no real title available?)
- Packing of convex polytopes into a parallelepiped
- scientific article; zbMATH DE number 3995477 (Why is no real title available?)
- A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines
- Using helical polyhedron for online irregular strip packing problem with free rotations
This page was built for publication: Packing convex polygons in minimum-perimeter convex hulls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679237)
