scientific article; zbMATH DE number 6698326
From MaRDI portal
Publication:2970472
Recommendations
- Approximating minimum-area rectangular and convex containers for packing convex polygons
- Approximating Smallest Containers for Packing Three-Dimensional Convex Objects
- scientific article; zbMATH DE number 6861944
- Packing convex polygons in minimum-perimeter convex hulls
- Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons
- Approximation algorithms for solving packing problems of convex polygons in plane
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
- A heuristic approach for packing identical rectangles in convex regions
- Integer programming formulations for approximate packing circles in a rectangular container
Cited in
(10)- Approximation algorithms for solving packing problems of convex polygons in plane
- Optimized packing clusters of objects in a rectangular container
- Packing 2D disks into a 3D container
- Approximating Smallest Containers for Packing Three-Dimensional Convex Objects
- Approximating minimum-area rectangular and convex containers for packing convex polygons
- scientific article; zbMATH DE number 1786500 (Why is no real title available?)
- scientific article; zbMATH DE number 6861944 (Why is no real title available?)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
- Decomposition algorithm for irregular placement problems
- Packing d-dimensional balls into a d + 1-dimensional container
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970472)
