The following pages link to (Q4461912):
Displaying 11 items.
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices (Q623315) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- Domination analysis for minimum multiprocessor scheduling (Q858313) (← links)
- A memetic algorithm for the generalized traveling salesman problem (Q968380) (← links)
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)
