Packing Problems
Packing Problems is a combinatorial optimization problem in which the objective is to determine whether a given set of discrete objects can be arranged within a container without overlap and subject to constraints, distinguishing it from other allocation problems by maximizing coverage or density under non-overlapping and geometric or capacity restrictions.
1.7K
Publications
94.8K
Citations
2.5K
Authors
1K
Institutions
Publications per year
2017–2026
259
1.7K
Sphere Packings, Lattices and Groups.
H. S. M. Coxeter, J. H. Conway, N. J. A. Sloane · American Mathematical Monthly · 1989 · 3.5K citations
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
D. S. Johnson, Alan Demers, Jeffrey D. Ullman et al. · SIAM Journal on Computing · 1974 · 913 citations
1–5 of 1.7K
2.5K
24
h-index
19
h-index
16
h-index
15
h-index
15
h-index
1–5 of 2.5K
1K

University of Bologna
Bologna, Italy
35 h-index
80 publications
13.3K citations

Huazhong University of Science and Technology
Wuhan, China
23 h-index
91 publications
3.2K citations
Universidade de São Paulo
São Paulo, Brazil
23 h-index
81 publications
3.3K citations

Centre National de la Recherche Scientifique
Paris, France
20 h-index
59 publications
2.7K citations
University of Haifa
Haifa, Israel
19 h-index
31 publications
814 citations

Universidade do Porto
Porto, Portugal
19 h-index
53 publications
2.5K citations

City University of Hong Kong
Hong Kong, Hong Kong
18 h-index
31 publications
1.6K citations
Massachusetts Institute of Technology
Cambridge, United States
17 h-index
29 publications
1.9K citations
1–8 of 1K
114 publications · 11.8K citations
47
h-index
85 publications · 4.7K citations
41
h-index
40 publications · 1.4K citations
25
h-index
29 publications · 4.4K citations
22
h-index
33 publications · 2K citations
21
h-index
1–5