Online Packing
Online Packing is an online algorithmic framework for sequentially allocating arriving resource demands into fixed capacity bins or containers without knowledge of future requests, where decisions to accept or reject each demand must be made immediately upon arrival to maximize packing efficiency under irrevocable commitment constraints.
87
Publications
3.2K
Citations
167
Authors
85
Institutions
Publications per year
2017–2026
29
Parents
87
On the online bin packing problem
Steven S. Seiden · Journal of the ACM · 2002 · 316 citations
Fast Algorithms for Online Stochastic Convex Programming
Shipra Agrawal, Nikhil R. Devanur · 2016 · 103 citations
Primal beats dual on online packing LPs in the random-order model
Thomas Keßelheim, Andreas Tönnis, Klaus Radke et al. · 2014 · 95 citations
1–5 of 87
167
11
h-index
11
h-index
8
h-index
7
h-index
6
h-index
1–5 of 167
85

University of Szeged
Szeged, Hungary
10 h-index
16 publications
349 citations
University of Haifa
Haifa, Israel
9 h-index
9 publications
238 citations

Cornell University
Ithaca, United States
8 h-index
15 publications
366 citations
Microsoft (United States)
Redmond, United States
7 h-index
8 publications
653 citations

Tel Aviv University
Tel Aviv, Israel
7 h-index
15 publications
424 citations
Technion – Israel Institute of Technology
Haifa, Israel
6 h-index
6 publications
387 citations
University of Pannonia
Veszprém, Hungary
5 h-index
5 publications
94 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
5 h-index
10 publications
240 citations
1–8 of 85
6 publications · 233 citations
6
h-index
Repository · 6 publications · 142 citations
6
h-index
Repository · 3 publications · 44 citations
3
h-index
3 publications · 64 citations
3
h-index
PER · 2 publications · 33 citations
2
h-index
1–5