-
1
-
-
2442460236
-
-
Technical report, Institut fuer Statistik und Operations Research, Universitaet Graz
-
L. Babel, B. Chen, H. Kellerer, and V. Kotov. On-line algorithms for cardinality constraint bin packing problems. Technical report, Institut fuer Statistik und Operations Research, Universitaet Graz, 2001.
-
(2001)
On-Line Algorithms for Cardinality Constraint Bin Packing Problems
-
-
Babel, L.1
Chen, B.2
Kellerer, H.3
Kotov, V.4
-
3
-
-
0033879594
-
Approximation algorithms for knapsack problems with cardinality constraints
-
A. Caprara, H. Kellerer, U. Pferschy, and D. Pisinger. Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operations Research, 123: 333–345, 2000.
-
(2000)
European Journal of Operations Research
, vol.123
, pp. 333-345
-
-
Caprara, A.1
Kellerer, H.2
Pferschy, U.3
Pisinger, D.4
-
4
-
-
0027850336
-
Recent advances in the modeling, scheduling and control of flexible automation
-
W. J. Davis, D. L. Setterdahl, J. G. Macro, V. Izokaitis, and B. Bauman. Recent advances in the modeling, scheduling and control of flexible automation. In Proc. of the Winter Simulation Conference, 143–155, 1993.
-
(1993)
In Proc. Of the Winter Simulation Conference
, pp. 143-155
-
-
Davis, W.J.1
Setterdahl, D.L.2
Macro, J.G.3
Izokaitis, V.4
Bauman, B.5
-
6
-
-
85031293038
-
Worst-case analysis of memory allocation algorithms
-
M.R. Garey, R.L. Graham, and J.D. Ullman. Worst-case analysis of memory allocation algorithms. In Proc. of STOC, 143–150, 1972.
-
(1972)
In
, pp. 143-150
-
-
Garey, M.R.1
Graham, R.L.2
Ullman, J.D.3
-
7
-
-
0031677333
-
Design and implementation of scalable continuous media servers
-
S. Ghandeharizadeh and R.R. Muntz. Design and implementation of scalable continuous media servers. Parallel Computing Journal, 24(1): 91–122, 1998.
-
(1998)
Parallel Computing Journal
, vol.24
, Issue.1
, pp. 91-122
-
-
Ghandeharizadeh, S.1
Muntz, R.R.2
-
8
-
-
0033879195
-
Approximation algorithms for data placement on parallel disks
-
L. Golubchik, S. Khanna, S. Khuller, R. Thurimella, and A. Zhu. Approximation algorithms for data placement on parallel disks. In Proc. of SODA, 223–232, 2000.
-
(2000)
Inproc. Of SODA
, pp. 223-232
-
-
Golubchik, L.1
Khanna, S.2
Khuller, S.3
Thurimella, R.4
Zhu, A.5
-
10
-
-
0003622855
-
Near-optimal bin packing algorithms
-
MIT
-
D.S. Johnson. Near-optimal bin packing algorithms. PhDt hesis, MIT, 1973.
-
(1973)
Phdt Hesis
-
-
Johnson, D.S.1
-
11
-
-
0016069667
-
Fast algorithms for bin packing
-
D.S. Johnson. Fast algorithms for bin packing. J. Comput. Sys. Sci., 8: 272–314, 1974.
-
(1974)
J. Comput. Sys. Sci.
, vol.8
, pp. 272-314
-
-
Johnson, D.S.1
-
12
-
-
0000339680
-
Worst-case performance bounds for simple one-dimensional packing algorithm
-
D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithm. SIAM Journal of Computing, 3: 256–278, 1974.
-
(1974)
SIAM Journal of Computing
, vol.3
, pp. 256-278
-
-
Johnson, D.S.1
Demers, A.2
Ullman, J.D.3
Garey, M.R.4
Graham, R.L.5
-
16
-
-
0347122294
-
Polynomial time approximation schemes for classconstrained packing problems
-
H. Shachnai and T. Tamir. Polynomial time approximation schemes for classconstrained packing problems. Journal of Scheduling, 4: 313–338, 2001.
-
(2001)
Journal of Scheduling
, vol.4
, pp. 313-338
-
-
Shachnai, H.1
Tamir, T.2
-
18
-
-
0141982763
-
On two class-constrained versions of the multiple knapsack problem
-
H. Shachnai and T. Tamir. On two class-constrained versions of the multiple knapsack problem. Algorithmica, 29: 442–467, 2001.
-
(2001)
Algorithmica
, vol.29
, pp. 442-467
-
-
Shachnai, H.1
Tamir, T.2
-
19
-
-
0030371953
-
On the asymptotic worst case behavior of harmonic fit
-
A. van Vliet. On the asymptotic worst case behavior of harmonic fit. J. of Algorithms 20: 113–136, 1996.
-
(1996)
J. Of Algorithms
, vol.20
, pp. 113-136
-
-
Van Vliet, A.1
-
21
-
-
0019005216
-
New algorithms for bin packing
-
A. Yao. New algorithms for bin packing. Journal of the ACM, 27: 207–227, 1980.
-
(1980)
Journal of the ACM
, vol.27
, pp. 207-227
-
-
Yao, A.1
|