Pages that link to "Item:Q1433650"

The following pages link to On the nearest neighbor rule for the traveling salesman problem (Q1433650):

Displaying 12 items.

• Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
• On the nearest neighbor rule for the metric traveling salesman problem (Q496440) (← links)
• An improved lower bound for competitive graph exploration (Q831137) (← links)
• A hybrid scatter search for the probabilistic traveling salesman problem (Q878568) (← links)
• Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem (Q933505) (← links)
• The approximation ratio of the greedy algorithm for the metric traveling salesman problem (Q1785355) (← links)
• Online graph exploration: New results on old and new algorithms (Q1929219) (← links)
• Online graph exploration on trees, unicyclic graphs and cactus graphs (Q2656355) (← links)
• Online Graph Exploration: New Results on Old and New Algorithms (Q3012942) (← links)
• THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS (Q5051225) (← links)
• Solving the Watchman Route Problem with Heuristic Search (Q5870496) (← links)
• Truly tight bounds for TSP heuristics (Q6047697) (← links)