On the nearest neighbor rule for the metric traveling salesman problem (Q496440): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963876309 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1401.2071 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Traveling-Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the nearest neighbor rule for the traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3693290 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reducibility among Combinatorial Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank | |||
Normal rank | |||
Latest revision as of 18:45, 10 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the nearest neighbor rule for the metric traveling salesman problem |
scientific article |
Statements
On the nearest neighbor rule for the metric traveling salesman problem (English)
0 references
21 September 2015
0 references
traveling salesman problem
0 references
nearest neighbor rule
0 references
approximation algorithm
0 references
