On the nearest neighbor rule for the traveling salesman problem (Q1433650): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Efficient special case algorithms for the n-line planar traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5187226 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-6377(03)00093-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2101753085 / rank | |||
Normal rank | |||
Latest revision as of 10:56, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the nearest neighbor rule for the traveling salesman problem |
scientific article |
Statements
On the nearest neighbor rule for the traveling salesman problem (English)
0 references
1 July 2004
0 references
Traveling salesman problem
0 references
Heuristic
0 references
Lower bound
0 references
