Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP (Q935238)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP |
scientific article; zbMATH DE number 5306952
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP |
scientific article; zbMATH DE number 5306952 |
Statements
Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP (English)
0 references
6 August 2008
0 references
cheapest insertion heuristic
0 references
greedy algorithm with regret
0 references
traveling salesman problem
0 references
