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

Authors

2.5K

  1. SM
    Silvano Martello

    University of Bologna, Italy

    26 publications · 4.8K citations

    24

    h-index

  2. LE
    Leah Epstein

    University of Haifa, Israel

    29 publications · 759 citations

    19

    h-index

  3. JF
    José Fernando Oliveira

    Universidade do Porto, Portugal

    17 publications · 995 citations

    16

    h-index

  4. EG
    E. G. Coffman

    AT&T (United States), United States

    17 publications · 1.8K citations

    15

    h-index

  5. RV
    Rob van Stee

    University of Haifa, Israel

    18 publications · 475 citations

    15

    h-index

1–5 of 2.5K

Venues

  1. European Journal of Operational Research

    114 publications · 11.8K citations

    47

    h-index

  2. Computers & Operations Research

    85 publications · 4.7K citations

    41

    h-index

  3. 25

    h-index

  4. SIAM Journal on Computing

    29 publications · 4.4K citations

    22

    h-index

  5. Discrete Applied Mathematics

    33 publications · 2K citations

    21

    h-index

1–5