메뉴 건너뛰기





Volumn , Issue , 1995, Pages 324-328

Very greedy crossover in a genetic algorithm for the traveling salesman problem

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; INVERSE PROBLEMS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING;

EID: 0029180658     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/315891.316009     Document Type: Conference Paper
Times cited : (27)

References (18)
  • Reference 정보가 존재하지 않습니다.

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