메뉴 건너뛰기




Volumn 29, Issue 9, 2002, Pages 1221-1235

A parallel genetic algorithm to solve the set-covering problem

Author keywords

Parallel genetic algorithms; Set covering problem

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION;

EID: 0036680959     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(01)00026-0     Document Type: Article
Times cited : (54)

References (33)
  • 3
    • 0015585112 scopus 로고
    • A technique for the solution of massive set-covering problems with application to airline crew scheduling
    • (1973) Transportation Science , vol.7 , pp. 34-48
    • Rubin, J.1


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