Lower bounds for on-line bin packing algorithms
Year of publication: |
1993
|
---|---|
Authors: | Vliet, André van |
Published in: |
Tinbergen Institute research bulletin. - Amsterdam [u.a.] : TI, ISSN 0924-056X, ZDB-ID 1041076-4. - Vol. 5.1993, 1, p. 31-46
|
Subject: | Verpackung | Packaging | Operations Research | Operations research | Theorie | Theory |
-
An improved lower bound for on-line bin packing algorithms
Vliet, André van, (1991)
-
Cutting and packing in production and distribution : a typology and bibliography
Dyckhoff, Harald, (1992)
-
Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
Galambos, Gábor, (1992)
- More ...
-
An improved lower bound for on-line al[g]orithms for 2-dimensional rectangle bin packing problem
Galambos, Gabor, (1993)
-
On the on-line scheduling algorithms RLS
Chen, Bo, (1993)
-
An optimal algorithm for preemtive on-line scheduling
Chen, Bo, (1994)
- More ...