Pages that link to "Item:Q496440"
From MaRDI portal
The following pages link to On the nearest neighbor rule for the metric traveling salesman problem (Q496440):
Displaying 10 items.
- A geometric problem involving the nearest neighbour algorithm (Q1094335) (← links)
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP (Q1348379) (← links)
- On the nearest neighbor rule for the traveling salesman problem (Q1433650) (← links)
- The approximation ratio of the greedy algorithm for the metric traveling salesman problem (Q1785355) (← links)
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
- On the Metric $s$--$t$ Path Traveling Salesman Problem (Q4641715) (← links)
- THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS (Q5051225) (← links)
- Truly tight bounds for TSP heuristics (Q6047697) (← links)
- Exploring Endless Space (Q6166765) (← links)
- The bright side of simple heuristics for the TSP (Q6635160) (← links)