Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem

DOI10.1007/978-3-030-33585-4_65MaRDI QIDQ5117310zbMATH OpenOpenAlexFDO

Authors Georgiy Yaskov, T. Romanova, S. B. Shekhovtsov, I. 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

zbMATH Keywords

optimizationknapsack problempackingopen dimension problemirregular objects

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

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

• A customized branch-and-bound approach for irregular shape nesting
• A fully general, exact algorithm for nesting irregular shapes
• A global optimization point of view to handle non-standard object packing problems
• A local search-based method for sphere packing problems
• Algorithms for nesting with defects
• An improved typology of cutting and packing problems
• Balance layout problem for 3D-objects: mathematical model and solution methods
• Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
• Irregular packing problems: a review of mathematical models
• Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
• Mathematical model and efficient algorithms for object packing problem
• Mathematical modeling of the interaction of non-oriented convex polytopes
• Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
• Modeling close packing of 3D objects
• On the global minimum in a balanced circular packing problem
• Optimal clustering of a pair of irregular objects
• Optimized packings with applications
• Packing circular-like objects in a rectangular container
• Packing congruent hyperspheres into a hypersphere
• Packing congruent spheres into a multi‐connected polyhedral domain
• Packing ellipses in an optimized convex polygon
• Packing equal circles into a circle with circular prohibited areas
• Packing of concave polyhedra with continuous rotations using nonlinear optimisation
• Packing unequal circles into a strip of minimal length with a jump algorithm
• Packing unequal spheres into various containers
• Phi-functions for 2D objects formed by line segments and circular arcs
• The method of artificial space dilation in problems of optimal packing of geometric objects

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)