Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem (Q757282): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:25, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem |
scientific article |
Statements
Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem (English)
0 references
1991
0 references
genetic algorithm
0 references
Darwinian evolution
0 references
near-optimal solutions to the Traveling Salesman Problem
0 references
heuristic algorithm
0 references
natural selection
0 references
time complexity
0 references
fastest sorting scheme
0 references
