A new extension principle algorithm for the traveling salesman problem (Q3962804): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Johannes Terno / rank | |||
| Property / author | |||
| Property / author: Johannes Terno / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02331938208842784 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033851048 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:43, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new extension principle algorithm for the traveling salesman problem |
scientific article |
Statements
A new extension principle algorithm for the traveling salesman problem (English)
0 references
1982
0 references
extension principle algorithm
0 references
branch-and-bound
0 references
algorithm
0 references
asymmetric traveling salesman problem
0 references
randomly generated test problems
0 references
computational tests
0 references
computation of lower bounds
0 references
assignment problem relaxation
0 references
