Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Steiner travelling salesman problem (view)

searching for Travelling salesman problem 13 found (124 total)

alternate case: travelling salesman problem

Kalmanson combinatorial conditions (192 words) [view diff] exact match in snippet view article find links to article

Woeginger, G. J. (1997), "Three easy special cases of the Euclidean travelling salesman problem" (PDF), RAIRO Recherche Opérationnelle, 31 (4): 343–362, MR 1491043

Subhamiltonian graph (641 words) [view diff] exact match in snippet view article find links to article

Naddef, D.; Pulleyblank, W. R. (1983), "Halin graphs and the travelling salesman problem", Mathematical Programming, 26 (3): 287–294, doi:10.1007/BF02591867

Luca Maria Gambardella (302 words) [view diff] exact match in snippet view article find links to article

Marco Dorigo, Luca Maria Gambardella, 1997. Ant colonies for the travelling salesman problem. Biosystems 43 (2): 73–81. doi:10.1016/S0303-2647(97)01708-5

Maurice Clerc (mathematician) (1,441 words) [view diff] case mismatch in snippet view article

work on the use of PSO for combinatorial problems, such as the Travelling Salesman Problem (TSP), is particularly innovative in that he completely redefines

Richard M. Durbin (2,101 words) [view diff] exact match in snippet view article find links to article

Durbin, R.; Willshaw, D. (1987). "An analogue approach to the travelling salesman problem using an elastic net method". Nature. 326 (6114): 689–691. Bibcode:1987Natur

Factor-critical graph (1,801 words) [view diff] exact match in snippet view article find links to article

graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem", Combinatorica, 3 (1): 35–52, doi:10.1007/BF02579340, MR 0716420

Mechthild Stoer (423 words) [view diff] case mismatch in snippet view article find links to article

diploma in 1987 with the thesis Dekompositionstechniken beim Travelling Salesman Problem. She continued working with Grötschel in Augsburg for a Ph.D

Guided local search (1,546 words) [view diff] case mismatch in snippet view article find links to article

Tsang, E.P.K., Guided Local Search and its application to the Travelling Salesman Problem, European Journal of Operational Research, Anbar Publishing,

Halin graph (2,157 words) [view diff] exact match in snippet view article find links to article

Naddef, D.; Pulleyblank, W. R. (1983), "Halin graphs and the travelling salesman problem", Mathematical Programming, 26 (3): 287–294, doi:10.1007/BF02591867

Perai Free Industrial Zone (244 words) [view diff] case mismatch in snippet view article find links to article

Management in Prai Industrial Area through GIS using Dijkstra and Travelling Salesman Problem Algorithms" (PDF). Pertanika Journal of Science and Technology

Minimum spanning tree (5,460 words) [view diff] exact match in snippet view article find links to article

Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, Report 388, Graduate School of Industrial Administration, CMU

Computational intelligence (5,553 words) [view diff] exact match in snippet view article find links to article

transfer learning-based particle swarm optimization algorithm for travelling salesman problem". Journal of Computational Design and Engineering. 9 (3): 933–948

Hopfield network (8,525 words) [view diff] case mismatch in snippet view article find links to article

Springer. ISBN 978-3-540-60505-8. Hopfield Network Javascript The Travelling Salesman Problem Archived 2015-05-30 at the Wayback Machine – Hopfield Neural