Mathematical model and efficient algorithms for object packing problem
From MaRDI portal
Publication:2269838
DOI10.1016/j.comgeo.2009.12.003zbMath1228.05117OpenAlexW2068513847MaRDI QIDQ2269838
Publication date: 11 March 2010
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.12.003
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of packing and covering (05B40)
Related Items (39)
Quasi-phi-functions and optimal packing of ellipses ⋮ A nonlinear programming model with implicit variables for packing ellipsoids ⋮ Packing ovals in optimized regular polygons ⋮ Extracting maximal objects from three-dimensional solid materials ⋮ The smallest convex \(k\)-gon containing \(n\) congruent disks ⋮ Packing convex polygons in minimum-perimeter convex hulls ⋮ Algorithms for nesting with defects ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ An overview on the use of operations research in additive manufacturing ⋮ Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem ⋮ Phi-functions for 2D objects formed by line segments and circular arcs ⋮ Configuration space of geometric objects ⋮ Multistage approach to solving the optimization problem of packing nonconvex polyhedra ⋮ 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 ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ The method of artificial space dilation in problems of optimal packing of geometric objects ⋮ Matheuristics for the irregular bin packing problem with free rotations ⋮ Numerical optimization method for packing regular convex polygons ⋮ Packing of concave polyhedra with continuous rotations using nonlinear optimisation ⋮ Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations ⋮ Packing different cuboids with rotations and spheres into a cuboid ⋮ Mathematical modeling of the interaction of non-oriented convex polytopes ⋮ Optimal clustering of a pair of irregular objects ⋮ Combinatorial configurations in balance layout optimization problems ⋮ Sparsest balanced packing of irregular 3D objects in a cylindrical container ⋮ Irregular packing problems: a review of mathematical models ⋮ Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry ⋮ Near optimal minimal convex hulls of disks ⋮ Balance layout problem for 3D-objects: mathematical model and solution methods ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem ⋮ A hybrid chaos firefly algorithm for three-dimensional irregular packing problem ⋮ Packing Problems in Space Solved by CPLEX: An Experimental Analysis ⋮ Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization ⋮ 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 ⋮ A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering a polygonal region by rectangles
- Tools of mathematical modeling of arbitrary object packing problems
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Compaction and separation algorithms for non-convex polygons and their applications
- Rotational polygon overlap minimization and compaction
- Rotational polygon containment and minimum enclosure using only robust 2D constructions
- Applied simulated annealing
- A 2-exchange heuristic for nesting problems
- \(\Phi\)-functions for complex 2D-objects
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- The geometry of nesting problems: a tutorial
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Mathematical modeling of interactions of primary geometric 3D objects
- An algebra of polygons through the notion of negative shapes
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Construction of a Φ-function for two convex polytopes
- Polygon decomposition for efficient construction of Minkowski sums
This page was built for publication: Mathematical model and efficient algorithms for object packing problem
