Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (Q1118534): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(89)90038-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006054213 / rank | |||
Normal rank | |||
Revision as of 23:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem |
scientific article |
Statements
Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (English)
0 references
1989
0 references
Computational results are presented for a parallel branch-and-bound algorithm that optimality solves the asymmetric traveling salesman problem. The algorithm uses an assignment problem based lower bounding technique, subtour elimination branching rules, and a subtour patching algorithm as an upper bounding procedure. Results are presented for randomly generated problems with sizes ranging from 50 to 3000 cities.
0 references
parallel branch-and-bound algorithm
0 references
asymmetric traveling salesman
0 references
assignment problem
0 references
lower bounding technique
0 references
subtour elimination
0 references
