메뉴 건너뛰기




Volumn 2462, Issue , 2002, Pages 243-255

Complexity of makespan minimization for pipeline transportation of petroleum products

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; DIRECTED GRAPHS; GASOLINE; PETROLEUM TRANSPORTATION; PIPELINE TERMINALS; PIPELINES;

EID: 84957042497     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45753-4_21     Document Type: Conference Paper
Times cited : (3)

References (8)
  • 5
    • 0006807792 scopus 로고
    • Polynomially bounded minimization problems that are hard to approximate
    • Kan94[] Viggo Kann. Polynomially bounded minimization problems that are hard to approximate. Nordic Journal of Computing, 1(3):317-331, 1994.
    • (1994) Nordic Journal of Computing , vol.1 , Issue.3 , pp. 317-331
    • Kann, V.1


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