Implementation of a parallel Genetic Algorithm on a cluster of workstations: Traveling Salesman Problem, a case study (Q4538537): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0167-739x(99)00134-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2080143744 / rank | |||
Normal rank |
Latest revision as of 11:11, 30 July 2024
scientific article; zbMATH DE number 1767268
Language | Label | Description | Also known as |
---|---|---|---|
English | Implementation of a parallel Genetic Algorithm on a cluster of workstations: Traveling Salesman Problem, a case study |
scientific article; zbMATH DE number 1767268 |
Statements
Implementation of a parallel Genetic Algorithm on a cluster of workstations: Traveling Salesman Problem, a case study (English)
0 references
14 July 2002
0 references
genetic algorithm
0 references
parallel virtual machine
0 references