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

Authors

2K

  1. LE
    Leah Epstein

    University of Haifa, Israel

    34 publications · 1K citations

    20

    h-index

  2. SM
    Silvano Martello

    University of Bologna, Italy

    19 publications · 4.1K citations

    17

    h-index

  3. EG
    E. G. Coffman

    AT&T (United States), United States

    20 publications · 2.7K citations

    17

    h-index

  4. GD
    György Dósa

    University of Pannonia, Hungary

    21 publications · 523 citations

    15

    h-index

  5. RV
    Rob van Stee

    University of Haifa, Israel

    17 publications · 474 citations

    15

    h-index

1–5 of 2K

Venues

  1. European Journal of Operational Research

    79 publications · 6.5K citations

    40

    h-index

  2. Computers & Operations Research

    60 publications · 3.1K citations

    34

    h-index

  3. SIAM Journal on Computing

    32 publications · 5K citations

    23

    h-index

  4. Discrete Applied Mathematics

    23 publications · 1.4K citations

    18

    h-index

  5. INFORMS journal on computing

    17 publications · 1.8K citations

    17

    h-index

1–5