Cluster based branching for the asymmetric traveling salesman problem (Q1806732)
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: Cluster based branching for the asymmetric traveling salesman problem |
scientific article; zbMATH DE number 1358198
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cluster based branching for the asymmetric traveling salesman problem |
scientific article; zbMATH DE number 1358198 |
Statements
Cluster based branching for the asymmetric traveling salesman problem (English)
0 references
4 April 2000
0 references
routing
0 references
branching scheme
0 references
asymmetric traveling salesman problem
0 references
clusters
0 references
branch and bound algorithms
0 references
0 references
