Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
From MaRDI portal
Recommendations
- Placement problems for irregular objects: mathematical modeling, optimization and applications
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Mathematical model and program system for solving a problem of logistic objects placement
- A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
- A model to optimize placement operations on dual-head placement machines
- scientific article; zbMATH DE number 1822170
- Optimization models for the dynamic facility location and allocation problem
- Efficient models for the facility layout problem
- scientific article; zbMATH DE number 610252
Cites work
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- An improved typology of cutting and packing problems
- Construction of a Φ-function for two convex polytopes
- Covering a compact polygonal set by identical circles
- Covering a polygonal region by rectangles
- Cutting circles and polygons from area-minimizing rectangles
- Fast neighborhood search for two- and three-dimensional nesting problems
- Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
- Irregular packing using the line and arc no-fit polygon
- MIP-based heuristic for non-standard 3D-packing problems
- Mathematical model and efficient algorithms for object packing problem
- Mathematical modeling of interactions of primary geometric 3D objects
- Minimizing the object dimensions in circle and sphere packing problems
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Packing congruent hyperspheres into a hypersphere
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Packing of convex polytopes into a parallelepiped
- Phi-functions for 2D objects formed by line segments and circular arcs
- Rotational polygon overlap minimization and compaction
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- The geometry of nesting problems: a tutorial
- Tools of mathematical modeling of arbitrary object packing problems
- Translational packing of arbitrary polytopes
- Two approximate Minkowski sum algorithms
- \(\Phi\)-functions for complex 2D-objects
Cited in
(21)- Configuration space of geometric objects
- Combinatorial configurations in balance layout optimization problems
- CAST: a successful project in support of the international space station logistics
- Optimized object packings using quasi-phi-functions
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
- The concept of modeling packing and covering problems using modern computational geometry software
- Optimal balanced packing using phi-function technique
- Balance layout problem for 3D-objects: mathematical model and solution methods
- Packing ellipsoids in an optimized cylinder
- Decomposition algorithm for irregular placement problems
- Sparsest balanced packing of irregular 3D objects in a cylindrical container
- Irregular packing problems: a review of mathematical models
- Continuous extensions on Euclidean combinatorial configurations
- Mixed-integer linear programming models for 3D irregular strip packing problems
- Theory and methods of Euclidian combinatorial optimization: current status and prospects
- A model to optimize placement operations on dual-head placement machines
- A local search-based method for sphere packing problems
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Packing ellipses in an optimized convex polygon
- Packing convex 3D objects with special geometric and balancing conditions
- Two approaches to modeling and solving the packing problem for convex polytopes
This page was built for publication: Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270075)
