Cluster based branching for the asymmetric traveling salesman problem (Q1806732): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:19, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cluster based branching for the asymmetric traveling salesman problem |
scientific article |
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
