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

Authors

1.9K

  1. LE
    Leah Epstein

    University of Haifa, Israel

    36 publications · 1.1K citations

    21

    h-index

  2. EG
    E. G. Coffman

    AT&T (United States), United States

    20 publications · 2.7K citations

    17

    h-index

  3. GD
    György Dósa

    University of Pannonia, Hungary

    21 publications · 523 citations

    15

    h-index

  4. RV
    Rob van Stee

    University of Haifa, Israel

    17 publications · 499 citations

    15

    h-index

  5. SM
    Silvano Martello

    University of Bologna, Italy

    16 publications · 3.2K citations

    15

    h-index

1–5 of 1.9K

Venues

  1. European Journal of Operational Research

    57 publications · 4.3K citations

    35

    h-index

  2. Computers & Operations Research

    48 publications · 2.5K citations

    31

    h-index

  3. SIAM Journal on Computing

    31 publications · 4.9K citations

    22

    h-index

  4. INFORMS journal on computing

    19 publications · 2.1K citations

    18

    h-index

  5. Discrete Applied Mathematics

    22 publications · 1.4K citations

    17

    h-index

1–5