-
1
Exact algorithms for the rectilinear block packing problem
Published 2018-07-01“…The rectilinear block packing problem is a problem of packing a set of rectilinear blocks into a larger rectangular container with fixed width and unrestricted height. …”
Get full text
Article -
2
Balanced Circular Packing Problems with Distance Constraints
Published 2022-07-01Get full text
Article -
3
An efficient constructive heuristic for the rectangular packing problem with rotations.
Published 2023-01-01“…The rectangular packing problem has been extensively studied over the years due to its wide application in industry. …”
Get full text
Article -
4
Two-dimensional irregular packing problems: A review
Published 2022-08-01“…Research on 2D irregular packing problems is essential for improving material utilization and industrial automation. …”
Get full text
Article -
5
Convex Maximization Formulation of General Sphere Packing Problem
Published 2020-03-01Subjects: “…sphere packing problem…”
Get full text
Article -
6
Methodology to Solve Multi-Dimentional Sphere Packing Problems
Published 2019-03-01“…According to the international classification, this problem belongs to Sphere Packing Problems (SPPs). The problem is to pack a set of spheres (circles, hyperspheres) with given radii into a container with given metric characteristics. …”
Get full text
Article -
7
Heuristic for oriented two-dimensional bin packing problem
Published 2009Get full text
Conference or Workshop Item -
8
Two-dimensional packing problems and optimization in distributed computing systems
Published 2018-10-01Get full text
Article -
9
Solving the two-dimensional packing problem with m-M calculus
Published 2011-01-01“…This paper considers the two dimensional rectangular packing problem. The mathematical formulation is based on the optimization of a non-linear function with piecewise linear constraints with a small number of real variables. …”
Get full text
Article -
10
A Hybrid Algorithm for Strip Packing Problem with Rotation Constraint
Published 2016-01-01“…This paper considers a two-dimensional orthogonal strip packing problem. Until now some exact algorithm and mainly heuristics were proposed for two-dimensional orthogonal strip packing problem. …”
Get full text
Article -
11
A hybrid approach of simulation and metaheuristic for the polyhedra packing problem
Published 2022-01-01“…This document presents a simulation-based method for the polyhedra packing problem (PPP). This problem refers to packing a set of irregular polyhedra (convex and concave) into a cuboid with the objective of minimizing the cuboid’s volume, considering non-overlapping and containment constraints. …”
Get full text
Article -
12
On one problem of Koffman-Shor connected to strip packing problem
Published 2018-10-01Get full text
Article -
13
State-of-the-art review on 3D bin packing problems
Published 2021“…This dissertation provides a comprehensive review of the state-of-the-art literature related to 3-D bin packing problems. The main purpose is twofold. First, to identify the strengths and weaknesses of the contributions in the literature. …”
Get full text
Thesis-Master by Coursework -
14
A Genetic Algorithm for Two-Dimensional Bin Packing Problem
Published 2008“…This paper considers a non-oriented twodimensional bin packing problem, where a set of small rectangles, which may be rotated by 90°, has to be allocated to one or more identical bins. …”
Get full text
Article -
15
Heuristic placement routines for two-dimensional bin packing problem.
Published 2009“…Problem statement: Cutting and packing (C and P) problems are optimization problems that are concerned in finding a good arrangement of multiple small items into one or more larger objects. Bin packing problem is a type of C AND P problems. Bin packing problem is an important industrial problem where the general objective is to reduce the production costs by maximizing the utilization of the larger objects and minimizing the material used. …”
Get full text
Article -
16
Pervasive Digital Twin for PI-Containers: A New Packing Problem
Published 2021-11-01Subjects: Get full text
Article -
17
Dynamic Programming Algorithms with Data Rounding for Combinatorial Food Packing Problems
Published 2013-03-01“…The lexicographic bi-criteria combinatorial food packing problem to be discussed in this paper is described as follows. …”
Get full text
Article -
18
A colloidal viewpoint on the sausage catastrophe and the finite sphere packing problem
Published 2023-11-01“…Here, our combined experimental and simulation study provides a physical realization of the finite sphere packing problem by studying arrangements of colloids in a flaccid lipid vesicle. …”
Get full text
Article -
19
An experimental comparison of some heuristics for cardinality constrained bin packing problem
Published 2012-01-01Subjects: “…cardinality constrained bin packing problem heuristics…”
Get full text
Article -
20
Bin Packing Problem with Item Time Window Conflict Dependent Profits
Published 2024-01-01Get full text
Article