A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01581188 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974443370 / rank | |||
Normal rank | |||
Latest revision as of 10:34, 30 July 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
0 references
0 references
0 references
