Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
From MaRDI portal
Publication:5117310
DOI10.1007/978-3-030-33585-4_65zbMATH Open1462.90116OpenAlexW2981809403MaRDI QIDQ5117310FDOQ5117310
Georgiy Yaskov, I. Litvinchev, S. B. Shekhovtsov, T. Romanova
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
Recommendations
- On Multidimensional Packing Problems
- scientific article; zbMATH DE number 1934389
- Characterizing the optimality gap and the optimal packings for the bin packing problem
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
- Optimized packings with applications
- Knapsack problems: a parameterized point of view
- scientific article; zbMATH DE number 1305407
- Kernelization of packing problems
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- A note on an open-end bin packing problem
Cites Work
- Mathematical model and efficient algorithms for object packing problem
- An improved typology of cutting and packing problems
- Optimal clustering of a pair of irregular objects
- Mathematical modeling of the interaction of non-oriented convex polytopes
- Packing congruent hyperspheres into a hypersphere
- Phi-functions for 2D objects formed by line segments and circular arcs
- Modeling close packing of 3D objects
- On the global minimum in a balanced circular packing problem
- Packing equal circles into a circle with circular prohibited areas
- Packing unequal circles into a strip of minimal length with a jump algorithm
- Algorithms for nesting with defects
- Packing unequal spheres into various containers
- Packing congruent spheres into a multi‐connected polyhedral domain
- Packing circular-like objects in a rectangular container
- A local search-based method for sphere packing problems
- Optimized packings with applications
- The method of artificial space dilation in problems of optimal packing of geometric objects
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Balance layout problem for 3D-objects: mathematical model and solution methods
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- A global optimization point of view to handle non-standard object packing problems
- 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 customized branch-and-bound approach for irregular shape nesting
- A fully general, exact algorithm for nesting irregular shapes
- Irregular packing problems: a review of mathematical models
- Packing ellipses in an optimized convex polygon
This page was built for publication: Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5117310)
