Placement problems for irregular objects: mathematical modeling, optimization and applications
From MaRDI portal
Recommendations
Cited in
(14)- Configuration space of geometric objects
- Lattice coverage of cuboid with minimum number of hemispheres
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- The concept of modeling packing and covering problems using modern computational geometry software
- Decomposition algorithm for irregular placement problems
- Packing convex polygons in minimum-perimeter convex hulls
- Irregular packing problems: a review of mathematical models
- Parallel computing technologies for solving optimization problems of geometric design
- Formalizing spatial configuration optimization problems with the use of a special function class
- Optimal clustering of a pair of irregular objects
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Placement of two- and three-dimensional irregular shapes for inertia moment and balance
- Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
- A fully general, exact algorithm for nesting irregular shapes
This page was built for publication: Placement problems for irregular objects: mathematical modeling, optimization and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1797563)