A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141)
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 fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs |
scientific article; zbMATH DE number 6676244
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs |
scientific article; zbMATH DE number 6676244 |
Statements
A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (English)
0 references
19 January 2017
0 references
tabu search
0 references
asymmetric traveling salesman problem
0 references
data structures
0 references
0 references
