메뉴 건너뛰기




Volumn , Issue , 2012, Pages 876-882

Minimum cost maximum flow algorithm for dynamic resource allocation in clouds

Author keywords

Cloud Computing; Linear Integer Programming; Minimum Cost Maximum Flow; Resource Allocation

Indexed keywords

ALLOCATION PROBLEMS; BIN-PACKING; CLOUD SERVICES; DYNAMIC RESOURCE ALLOCATIONS; DYNAMIC VARIATIONS; EXACT METHODS; FINITE NUMBER; LINEAR INTEGER PROGRAMMING; LINEAR INTEGER PROGRAMS; MAXIMUM FLOWS; MAXIMUM-FLOW ALGORITHM; MINIMUM COST; NEAR-OPTIMAL PERFORMANCE; PHYSICAL RESOURCES; VIRTUAL MACHINES;

EID: 84866749133     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLOUD.2012.36     Document Type: Conference Paper
Times cited : (76)

References (12)
  • 9
    • 0015330635 scopus 로고
    • Theoretical improvements in algorithmic efficiency for network flow problems
    • April
    • J. Edmonds and R. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems," Journal of the Association for Computing Machinery, vol. 19, no. 02, pp. 248-264, April 1972.
    • (1972) Journal of the Association for Computing Machinery , vol.19 , Issue.2 , pp. 248-264
    • Edmonds, J.1    Karp, R.2
  • 10
    • 84866753376 scopus 로고    scopus 로고
    • http://www-01.ibm.com/software/integration/optimization/cplexoptimizer/.


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