Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
From MaRDI portal
Publication:5270075
DOI10.1007/978-1-4614-4469-5_15zbMath1365.90163OpenAlexW114756732MaRDI QIDQ5270075
Tatiana E. Romanova, Yu. G. Stoyan
Publication date: 29 June 2017
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-4469-5_15
Related Items (18)
Two approaches to modeling and solving the packing problem for convex polytopes ⋮ A local search-based method for sphere packing problems ⋮ Packing ellipsoids in an optimized cylinder ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ The concept of modeling packing and covering problems using modern computational geometry software ⋮ Decomposition Algorithm for Irregular Placement Problems ⋮ Packing Convex 3D Objects with Special Geometric and Balancing Conditions ⋮ Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem ⋮ Configuration space of geometric objects ⋮ Theory and methods of Euclidian combinatorial optimization: current status and prospects ⋮ CAST: A Successful Project in Support of the International Space Station Logistics ⋮ Optimized Object Packings Using Quasi-Phi-Functions ⋮ Packing ellipses in an optimized convex polygon ⋮ Combinatorial configurations in balance layout optimization problems ⋮ Unnamed Item ⋮ Sparsest balanced packing of irregular 3D objects in a cylindrical container ⋮ Irregular packing problems: a review of mathematical models ⋮ Balance layout problem for 3D-objects: mathematical model and solution methods
Cites Work
- Unnamed Item
- Packing congruent hyperspheres into a hypersphere
- Phi-functions for 2D objects formed by line segments and circular arcs
- 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
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
- Covering a compact polygonal set by identical circles
- Translational packing of arbitrary polytopes
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- MIP-based heuristic for non-standard 3D-packing problems
- Cutting circles and polygons from area-minimizing rectangles
- Rotational polygon overlap minimization and compaction
- \(\Phi\)-functions for complex 2D-objects
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Mathematical model and efficient algorithms for object packing problem
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- The geometry of nesting problems: a tutorial
- Minimizing the object dimensions in circle and sphere packing problems
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Mathematical modeling of interactions of primary geometric 3D objects
- Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- Irregular Packing Using the Line and Arc No-Fit Polygon
- Construction of a Φ-function for two convex polytopes
- Packing of convex polytopes into a parallelepiped
- TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS
This page was built for publication: Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
