Bin Packing
Bin Packing is a computational optimization problem in which a set of discrete items of various sizes must be allocated to a finite number of fixed-capacity containers, or "bins," such that the total number of bins used is minimized.
1.1K
Publications
56.5K
Citations
1.9K
Authors
791
Institutions
Publications per year
2017–2026
266
Parents
1.1K
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
Orthogonal Packings in Two Dimensions
Brenda S. Baker, E. G. Coffman, Ronald L. Rivest · SIAM Journal on Computing · 1980 · 695 citations
The Three-Dimensional Bin Packing Problem
Silvano Martello, David Pisinger, Daniele Vigo · Operations Research · 2000 · 652 citations
A hybrid grouping genetic algorithm for bin packing
Emanuel Falkenauer · Journal of Heuristics · 1996 · 597 citations
1–5 of 1.1K
1.9K
21
h-index
17
h-index
15
h-index
15
h-index
15
h-index
1–5 of 1.9K
791

University of Bologna
Bologna, Italy
28 h-index
61 publications
9.1K citations

University of Szeged
Szeged, Hungary
20 h-index
49 publications
1.5K citations
University of Haifa
Haifa, Israel
19 h-index
31 publications
833 citations

Centre National de la Recherche Scientifique
Paris, France
19 h-index
57 publications
2.3K citations
AT&T (United States)
Bedminster, United States
16 h-index
33 publications
2.2K citations
Massachusetts Institute of Technology
Cambridge, United States
15 h-index
21 publications
1.7K citations

University of Modena and Reggio Emilia
Modena, Italy
14 h-index
26 publications
1.4K citations
Technion – Israel Institute of Technology
Haifa, Israel
14 h-index
22 publications
650 citations
1–8 of 791
57 publications · 4.3K citations
35
h-index
48 publications · 2.5K citations
31
h-index
31 publications · 4.9K citations
22
h-index
19 publications · 2.1K citations
18
h-index
22 publications · 1.4K citations
17
h-index
1–5