A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:43, 31 January 2024
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
