Tools of mathematical modeling of arbitrary object packing problems
From MaRDI portal
(Redirected from Publication:610987)
Recommendations
- Phi-functions for 2D objects formed by line segments and circular arcs
- Mathematical model and efficient algorithms for object packing problem
- \(\Phi\)-functions for complex 2D-objects
- Optimized object packings using quasi-phi-functions
- A mathematical model and a method of solution the packing optimization problem for arbitrary 2D objects in rectangular domains
Cites work
- scientific article; zbMATH DE number 3996639 (Why is no real title available?)
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- A method of optimal lattice packing of congruent oriented polygons in the plane
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Construction of a Φ-function for two convex polytopes
- Covering Polygons Is Hard
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
- Mathematical modeling of interactions of primary geometric 3D objects
- Packing of convex polytopes into a parallelepiped
- Regular packing of congruent polygons on the rectangular sheet
- \(\Phi\)-functions for complex 2D-objects
Cited in
(25)- Irregular packing: MILP model based on a polygonal enclosure
- Configuration space of geometric objects
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- A mathematical model and a method of solution the packing optimization problem for arbitrary 2D objects in rectangular domains
- Optimized object packings using quasi-phi-functions
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Quasi-phi-functions and optimal packing of ellipses
- The concept of modeling packing and covering problems using modern computational geometry software
- Phi-functions for 2D objects formed by line segments and circular arcs
- Optimal balanced packing using phi-function technique
- Construction of a Φ-function for two convex polytopes
- \(\Phi\)-functions for complex 2D-objects
- Covering a polygonal region by rectangles
- Modeling close packing of 3D objects
- Irregular packing problems: a review of mathematical models
- Decomposition algorithm for geometric objects in 2D packing and cutting problems
- Mathematical model and efficient algorithms for object packing problem
- Mathematical modeling of distance constraints on two-dimensional \(\varphi\)-objects
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
- Optimal clustering of a pair of irregular objects
- Packing ovals in optimized regular polygons
- Packing congruent spheres into a multi‐connected polyhedral domain
- Multiple obnoxious facility location: the case of protected areas
This page was built for publication: Tools of mathematical modeling of arbitrary object packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q610987)
