Bin Packing Problem
The Bin Packing Problem is a combinatorial optimization problem in integer programming that consists in determining the minimum number of identical bins required to pack a given set of items without exceeding the capacity of any bin, where each item must be assigned to exactly one bin and no item may be split.
1.1K
Publications
63.4K
Citations
2K
Authors
827
Institutions
Publications per year
2017–2026
243
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
1–5 of 1.1K
2K
20
h-index
17
h-index
17
h-index
15
h-index
15
h-index
1–5 of 2K
827

University of Bologna
Bologna, Italy
33 h-index
69 publications
11.9K citations

University of Szeged
Szeged, Hungary
20 h-index
49 publications
1.5K citations

Centre National de la Recherche Scientifique
Paris, France
20 h-index
62 publications
2.2K citations
University of Haifa
Haifa, Israel
19 h-index
29 publications
766 citations
AT&T (United States)
Bedminster, United States
15 h-index
31 publications
2K citations

Zhejiang University
Hangzhou, China
14 h-index
18 publications
581 citations

University of Modena and Reggio Emilia
Modena, Italy
14 h-index
27 publications
1.5K citations
Massachusetts Institute of Technology
Cambridge, United States
14 h-index
19 publications
1.4K citations
1–8 of 827
79 publications · 6.5K citations
40
h-index
60 publications · 3.1K citations
34
h-index
32 publications · 5K citations
23
h-index
23 publications · 1.4K citations
18
h-index
17 publications · 1.8K citations
17
h-index
1–5