View Author
heuristic problem algorithm result number height h n f rectangle element piece value proof solution value list l analysis block section solution next-fit algorithm frenk sequence galambo bin-packing function theorem pairing heuristic distribution interval next-fit performance a-type bin item sizes nfd heuristic weight csirik b 2-type bin inequality coffman renewal theory performance ratio siam j johnson liang n items j.b.g variable a-type nf heuristic uniform distribution bin-packing problem width pairing lemma 7 s-interval renewal theory order probability baker university ratio s-interval 1 / i lim e 1 pieces process conditions i weight function bin b probability theory type i argument right hand side / ~ n +2 n limit theorem garey right renewal theorem yields yield
4 Most Recent Publications
|
A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
(Article)
Frenk, J.B.G. Galambos, G. |
1993-01-29
|
|
Probabilistic analysis of algorithms for dual bin packing problems
(Article)
Csirik, J. Frenk, J.B.G. Galambos, G. Rinnooy Kan, A.H.G. |
1991-06-01
|
|
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
(Article)
Frenk, J.B.G. Galambos, G. |
1987-09-01
|
|
A probabilistic analysis of the next fit decreasing bin packing heuristic
(Article)
Csirik, J. Galambos, G. Frenk, J.B.G. Frieze, A.M. Rinnooy Kan, A.H.G. |
1986-11-01
|
