A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem (Q2583172): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:10, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem |
scientific article |
Statements
A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem (English)
0 references
13 January 2006
0 references
traveling salesman problem
0 references
genetic algorithms
0 references
metaheuristics
0 references
Lagrangean relaxation
0 references
greedy randomized adaptive search procedure
0 references
