A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853)
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 parallel branch and bound algorithm for solving large asymmetric traveling salesman problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems |
scientific article |
Statements
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (English)
0 references
6 October 1992
0 references
parallel branch-and-bound algorithm
0 references
asymmetric traveling salesman
0 references
lower bounding technique subtour elimination
0 references
0 references
0 references
0 references
