Method of sentinels for packing items within arbitrary convex regions
From MaRDI portal
Publication:3418861
Recommendations
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Using sentinels to detect intersections of convex and nonconvex polygons
- Numerical optimization method for packing regular convex polygons
- A problem of packing homothetic convex polytopes
- A heuristic approach for packing identical rectangles in convex regions
Cited in
(10)- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Hybrid spectral gradient method for the unconstrained minimization problem
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
- Using sentinels to detect intersections of convex and nonconvex polygons
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Symmetry-breaking constraints for packing identical rectangles within polyhedra
- Rigorous packing of unit squares into a circle
- Minimizing the object dimensions in circle and sphere packing problems
- A heuristic approach for packing identical rectangles in convex regions
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
This page was built for publication: Method of sentinels for packing items within arbitrary convex regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418861)
