Tools of mathematical modeling of arbitrary object packing problems
From MaRDI portal
Publication:610987
DOI10.1007/s10479-008-0456-5zbMath1201.90167OpenAlexW2042647843MaRDI QIDQ610987
Publication date: 13 December 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0456-5
Related Items
Quasi-phi-functions and optimal packing of ellipses ⋮ Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization ⋮ Packing ovals in optimized regular polygons ⋮ 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 ⋮ Configuration space of geometric objects ⋮ Decomposition algorithm for geometric objects in 2D packing and cutting problems ⋮ Mathematical modeling of distance constraints on two-dimensional \(\varphi\)-objects ⋮ Optimized Object Packings Using Quasi-Phi-Functions ⋮ Rectangle blanket problem: binary integer linear programming formulation and solution algorithms ⋮ Packing congruent spheres into a multi‐connected polyhedral domain ⋮ Covering a polygonal region by rectangles ⋮ Mathematical model and efficient algorithms for object packing problem ⋮ Optimal clustering of a pair of irregular objects ⋮ Irregular packing problems: a review of mathematical models ⋮ Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry ⋮ Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications ⋮ Irregular packing: MILP model based on a polygonal enclosure ⋮ Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
Cites Work
- Unnamed Item
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Regular packing of congruent polygons on the rectangular sheet
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
- A method of optimal lattice packing of congruent oriented polygons in the plane
- \(\Phi\)-functions for complex 2D-objects
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- Mathematical modeling of interactions of primary geometric 3D objects
- Covering Polygons Is Hard
- Construction of a Φ-function for two convex polytopes
- Packing of convex polytopes into a parallelepiped
