메뉴 건너뛰기




Volumn , Issue , 2009, Pages 162-167

A general model for virtual machines resources allocation in multi-tier distributed systems

Author keywords

[No Author keywords available]

Indexed keywords

0/1 KNAPSACK PROBLEMS; DISTRIBUTED ENVIRONMENTS; DISTRIBUTED SYSTEMS; GENERAL MODEL; MULTI-TIER; NEAR OPTIMUM; RESOURCE VECTORS; RESOURCES ALLOCATION; VIRTUAL MACHINES;

EID: 67650650366     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICAS.2009.49     Document Type: Conference Paper
Times cited : (22)

References (19)
  • 1
    • 26444509453 scopus 로고    scopus 로고
    • Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
    • M. M. Akbar, M. S. Rahman, M. Kaykobad, E. G. Manning, and G. C. Shoja. Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls. Comput. Oper. Res., 33(5):1259-1273, 2006.
    • (2006) Comput. Oper. Res , vol.33 , Issue.5 , pp. 1259-1273
    • Akbar, M.M.1    Rahman, M.S.2    Kaykobad, M.3    Manning, E.G.4    Shoja, G.C.5
  • 5
    • 0036541179 scopus 로고    scopus 로고
    • An approximate dynamic programming approach to multidimensional knapsack problems
    • D. Bertsimas and R. Demir. An approximate dynamic programming approach to multidimensional knapsack problems. Manage. Sci., 48(4):550-565, 2002.
    • (2002) Manage. Sci , vol.48 , Issue.4 , pp. 550-565
    • Bertsimas, D.1    Demir, R.2
  • 7
    • 0032090794 scopus 로고    scopus 로고
    • A genetic algorithm for the multidimensional knapsack problem
    • P. C. Chu and J. E. Beasley. A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics, 4(1):63-86, 1998.
    • (1998) Journal of Heuristics , vol.4 , Issue.1 , pp. 63-86
    • Chu, P.C.1    Beasley, J.E.2
  • 8
    • 0030303866 scopus 로고    scopus 로고
    • Solving multiple knapsack problems by cutting planes
    • C. E. Ferreira, A. Martin, and R. Weismantel. Solving multiple knapsack problems by cutting planes. SIAM J. on Optimization, 6(3):858-877, 1996.
    • (1996) SIAM J. on Optimization , vol.6 , Issue.3 , pp. 858-877
    • Ferreira, C.E.1    Martin, A.2    Weismantel, R.3
  • 10
    • 33645146389 scopus 로고    scopus 로고
    • A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
    • M. Hifi, M. Michrafy, and A. Sbihi. A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem. Comput. Optim. Appl., 33(2-3):271-285, 2006.
    • (2006) Comput. Optim. Appl , vol.33 , Issue.2-3 , pp. 271-285
    • Hifi, M.1    Michrafy, M.2    Sbihi, A.3
  • 11
    • 67650679469 scopus 로고    scopus 로고
    • E. G. C. Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: a survey. pages 46-93, 1997.
    • E. G. C. Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: a survey. pages 46-93, 1997.
  • 16
    • 0037897397 scopus 로고
    • A minimal algorithm for the multiple-choice knapsack problem
    • D. Pisinger. A minimal algorithm for the multiple-choice knapsack problem. European Journal of Operational Research, 83:394-410, 1995.
    • (1995) European Journal of Operational Research , vol.83 , pp. 394-410
    • Pisinger, D.1


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