Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
From MaRDI portal
Publication:5117310
DOI10.1007/978-3-030-33585-4_65zbMath1462.90116OpenAlexW2981809403MaRDI QIDQ5117310
Georgiy Yaskov, S. B. Shekhovtsov, Tatiana E. Romanova, Igor S. Litvinchev
Publication date: 20 August 2020
Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-33585-4_65
Cites Work
- Modeling close packing of 3D objects
- On the global minimum in a balanced circular packing problem
- Packing unequal spheres into various containers
- Algorithms for nesting with defects
- Packing congruent hyperspheres into a hypersphere
- Phi-functions for 2D objects formed by line segments and circular arcs
- Packing circular-like objects in a rectangular container
- The method of artificial space dilation in problems of optimal packing of geometric objects
- Balance layout problem for 3D-objects: mathematical model and solution methods
- A local search-based method for sphere packing problems
- A customized branch-and-bound approach for irregular shape nesting
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- 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
- A global optimization point of view to handle non-standard object packing problems
- Optimal clustering of a pair of irregular objects
- A fully general, exact algorithm for nesting irregular shapes
- Mathematical modeling of the interaction of non-oriented convex polytopes
- Mathematical model and efficient algorithms for object packing problem
- Packing ellipses in an optimized convex polygon
- Irregular packing problems: a review of mathematical models
- Optimized packings with applications
- Packing unequal circles into a strip of minimal length with a jump algorithm
- An improved typology of cutting and packing problems
- Packing equal circles into a circle with circular prohibited areas
- Packing congruent spheres into a multi‐connected polyhedral domain
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
This page was built for publication: Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
