A threshold constraint based depth-first-search branch-bound algorithm for solving asymmetric traveling salesman problems (Q3402682)
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 threshold constraint based depth-first-search branch-bound algorithm for solving asymmetric traveling salesman problems |
scientific article; zbMATH DE number 5669764
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A threshold constraint based depth-first-search branch-bound algorithm for solving asymmetric traveling salesman problems |
scientific article; zbMATH DE number 5669764 |
Statements
12 February 2010
0 references
asymmetric traveling salesman problem
0 references
branch-bound algorithm
0 references
scheduling
0 references
0.8347197771072388
0 references
0.8316120505332947
0 references
0.8280847668647766
0 references
0.796441912651062
0 references
