Results 21 to 30 of about 41,714 (265)
We present a new class of random packing, called an “areal random packing”, in the plane. After performing computer simulations, we obtain the areal packing density through statistical analysis.
Masaharu Tanemura
doaj +1 more source
Parallel Algorithm of Balanced Sparse Packing of Rectangular Parallelepipeds
Introduction. Varieties of the problem of packing of rectangular parallelepipeds have a wide practical application in various fields of activity, for example, in the optimal filling of containers, in the design and layout of a wide variety of ...
Oleg Berezovskyi +2 more
doaj +1 more source
The rectangular packing problem is an NP-complete combinatorial optimization problem. This problem occurs widely in social production scenarios, with steel plate cutting being one example.
Jianqiao Xu, Wenguo Yang
doaj +1 more source
Experimental study of cooling tower performance using ceramic tile packing [PDF]
Deterioration of the packing material is a major problem in cooling towers. In this experimental study ceramic tiles were used as a packing material. The packing material is a long life burnt clay, which is normally used as a roofing material.
Ramkumar Ramkrishnan, Ragupathy Arumugam
doaj +1 more source
On the Packing Partitioning Problem on Directed Graphs
This work is aimed to continue studying the packing sets of digraphs via the perspective of partitioning the vertex set of a digraph into packing sets (which can be interpreted as a type of vertex coloring of digraphs) and focused on finding the minimum ...
Babak Samadi, Ismael G. Yero
doaj +1 more source
On on-line algorithms for Bin, Strip and Box Packing, and their worstand average-case analysis
In this survey, online algorithms for such packing problems as Bin Packing, Strip Packing and their generalizations, such as Multidimensional Bin Packing, Multiple Strip Packing and packing into strips of different width were considered.
D. O. Lazarev, N. N. Kuzjurin
doaj +1 more source
A Finite Packing Problem [PDF]
The maximum density of packings of a given type into the whole of a Euclidean space is defined to be the limit of the maximum density of such packings into a cube as the edge of the cube goes to infinity.For E2 in particular, a number of well known results such as those due to A. Thue [1], L. Fejes-Toth [2], and C. A.
openaire +1 more source
Rectangular Bin-Packing Problem: a computational evaluation of 4 heuristics algorithms
The Rectangular Bin-packing Problem, also known as The Two-dimensional Bin-packing Problem (2DBPP), is a well-known combinatorial optimization problem which is the problem of orthogonally packing a given set of rectangles into a minimum number of two ...
Duarte Nuno Gonçalves Ferreira
doaj +1 more source
A Genetic Algorithm for the Maximum 2–Packing Set Problem
Given an undirected connected graph G = (V, E), a subset of vertices S is a maximum 2-packing set if the number of edges in the shortest path between any pair of vertices in S is at least 3 and S has the maximum cardinality.
Trejo-Sánchez Joel Antonio +2 more
doaj +1 more source
Dental Restorations Packing Based on the Contour Similar Features Matching and Collision Strategy
Dental restoration is a complex process to recover patients' teeth using artificial materials. It is important to improve the utilization of the expensive material for cost saving.
Baosu Guo +4 more
doaj +1 more source

