Results 171 to 180 of about 30,647 (208)
Some of the next articles are maybe not open access.
Das Traveling Salesman Problem
1970Unter den Reihenfolgeproblemen hat das Traveling Salesman Problem eine besondere Bedeutung. Aus diesem Grund ist ihm der meiste Platz dieses Buches gewidmet. Haufig werden sogar die Begriffe Reihenfolgeproblem und Traveling Salesman Problem synonym verwendet.
openaire +1 more source
The Traveling Salesman Problem
2020The Traveling Salesman Problem (TSP) is a classical algorithm problem. It consists of identifying the shortest possible route between several connected cities. Not only is the problem relevant from an algorithmic point of view, but it also has many concrete applications, like microchip manufacturing, as you will shorty see.
openaire +1 more source
The Traveling-Salesman Problem
Operations Research, 1956The traveling-salesman problem is that of finding a permutation P = (1 i2 i3 … in) of the integers from 1 through n that minimizes the quantity [Formula: see text] where the aαβ are a given set of real numbers. More accurately, since there are only (n − 1)′ possibilities to consider, the problem is to find an efficient method for choosing a minimizing
openaire +1 more source
Discrete Spider Monkey Optimization for Travelling Salesman Problem
Applied Soft Computing Journal, 2020M A H Akhand +2 more
exaly
Discrete Grey Wolf Optimizer for symmetric travelling salesman problem
Applied Soft Computing Journal, 2021Kusum Deep
exaly