A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks (Q3792508)
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: A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks |
scientific article; zbMATH DE number 4057320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks |
scientific article; zbMATH DE number 4057320 |
Statements
A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks (English)
0 references
1988
0 references
heuristic
0 references
traveling salesman location problem
0 references
network
0 references
repair vehicle
0 references
worst case analysis
0 references
asymptotic results
0 references
0.8790372610092163
0 references
0.8749959468841553
0 references
0.8567707538604736
0 references
0.8495233058929443
0 references
0.8471940755844116
0 references
