Exact solution of large-scale, asymmetric traveling salesman problems (Q4371607)
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: Exact solution of large-scale, asymmetric traveling salesman problems |
scientific article; zbMATH DE number 1105968
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact solution of large-scale, asymmetric traveling salesman problems |
scientific article; zbMATH DE number 1105968 |
Statements
Exact solution of large-scale, asymmetric traveling salesman problems (English)
0 references
26 January 1998
0 references
branch-and-bound algorithm
0 references
asymmetric traveling salesman problem
0 references
assignment problem
0 references
elimination branching scheme
0 references
reduction
0 references
no wait flow shop problems
0 references
stacker crane problems
0 references
0.8779988884925842
0 references
0.8530336618423462
0 references
0.8495287299156189
0 references
0.8471788763999939
0 references
0.8387354612350464
0 references
