Mathematical model and efficient algorithms for object packing problem
From MaRDI portal
Publication:2269838
DOI10.1016/J.COMGEO.2009.12.003zbMATH Open1228.05117OpenAlexW2068513847MaRDI QIDQ2269838FDOQ2269838
Authors: Yanyan Li 
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
Recommendations
- Tools of mathematical modeling of arbitrary object packing problems
- Phi-functions for 2D objects formed by line segments and circular arcs
- 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
- Modeling close packing of 3D objects
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Title not available (Why is that?)
- Compaction and separation algorithms for non-convex polygons and their applications
- A 2-exchange heuristic for nesting problems
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- The geometry of nesting problems: a tutorial
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Title not available (Why is that?)
- Tools of mathematical modeling of arbitrary object packing problems
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Title not available (Why is that?)
- Applied simulated annealing
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- \(\Phi\)-functions for complex 2D-objects
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Rotational polygon overlap minimization and compaction
- Rotational polygon containment and minimum enclosure using only robust 2D constructions
- Covering a polygonal region by rectangles
- Construction of a Φ-function for two convex polytopes
- Mathematical modeling of interactions of primary geometric 3D objects
- Polygon decomposition for efficient construction of Minkowski sums
- An algebra of polygons through the notion of negative shapes
- Title not available (Why is that?)
Cited In (42)
- Packing different cuboids with rotations and spheres into a cuboid
- 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
- Near optimal minimal convex hulls of disks
- Tools of mathematical modeling of arbitrary object packing problems
- Combinatorial configurations in balance layout optimization problems
- An overview on the use of operations research in additive manufacturing
- Packing problems in space solved by CPLEX: an experimental analysis
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- A nonlinear programming model with implicit variables for packing ellipsoids
- 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
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
- Optimized packing multidimensional hyperspheres: a unified approach
- Quasi-phi-functions and optimal packing of ellipses
- Phi-functions for 2D objects formed by line segments and circular arcs
- Balance layout problem for 3D-objects: mathematical model and solution methods
- Sparsest balanced packing of irregular 3D objects in a cylindrical container
- Packing convex polygons in minimum-perimeter convex hulls
- Multistage approach to solving the optimization problem of packing nonconvex polyhedra
- \(\Phi\)-functions for complex 2D-objects
- Irregular packing problems: a review of mathematical models
- The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
- Decomposition algorithm for geometric objects in 2D packing and cutting problems
- A hybrid chaos firefly algorithm for three-dimensional irregular packing problem
- Matheuristics for the irregular bin packing problem with free rotations
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
- Algorithms for nesting with defects
- Mathematical modeling of distance constraints on two-dimensional \(\varphi\)-objects
- The smallest convex \(k\)-gon containing \(n\) congruent disks
- Extracting maximal objects from three-dimensional solid materials
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Optimal clustering of a pair of irregular objects
- Packing ovals in optimized regular polygons
- Mathematical modeling of the interaction of non-oriented convex polytopes
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- Numerical optimization method for packing regular convex polygons
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- The method of artificial space dilation in problems of optimal packing of geometric objects
Uses Software
This page was built for publication: Mathematical model and efficient algorithms for object packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269838)
