메뉴 건너뛰기




Volumn 2286, Issue , 2002, Pages 569-583

Tight bounds for online class-constrained packing

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; MANUFACTURE;

EID: 84937500961     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45995-2_49     Document Type: Conference Paper
Times cited : (1)

References (21)
  • 6
    • 85031293038 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 10
    • 0003622855 scopus 로고
    • 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 scopus 로고
    • 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
  • 13
  • 15
    • 0013011382 scopus 로고
    • Algorithms for knapsack problems
    • S. Martello and P. Toth. Algorithms for knapsack problems. Annals of Discrete Math., 31: 213–258, 1987.
    • (1987) Annals of Discrete Math. , vol.31 , pp. 213-258
    • Martello, S.1    Toth, P.2
  • 16
    • 0347122294 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.