Nonoblivious 2-Opt heuristics for the traveling salesman problem (Q2811309): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Concorde / rank | |||
Normal rank | |||
Revision as of 18:42, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonoblivious 2-Opt heuristics for the traveling salesman problem |
scientific article |
Statements
Nonoblivious 2-Opt heuristics for the traveling salesman problem (English)
0 references
10 June 2016
0 references
TSP
0 references
2-opt
0 references
local search
0 references
heuristics
0 references
performance guarantees
0 references
approximation algorithms
0 references
