Results 141 to 150 of about 2,267 (186)
Some of the next articles are maybe not open access.
1986
Let G be a complete graph with an associated distance matrix (dij) on its edges. The traveling salesman problem is to start from a node in G, visit every other node exactly once and return back to the starting node in such a way that the total traveled distance is minimum.
openaire +1 more source
Let G be a complete graph with an associated distance matrix (dij) on its edges. The traveling salesman problem is to start from a node in G, visit every other node exactly once and return back to the starting node in such a way that the total traveled distance is minimum.
openaire +1 more source
Pyramidal traveling salesman problem
Computers & Operations Research, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baki, Md. Fazle, Kabadi, Santosh N.
openaire +1 more source
Traveling Salesman Facility Location Problems
Transportation Science, 1989We consider two generic facility location problems, the traveling salesman facility location problem (TSFLP) and the probabilistic traveling salesman facility location problem (PTSFLP), both of which have been a subject of intensive investigation recently.
openaire +1 more source
The Traveling Salesman Problem
2000In Chapter 15 we introduced the TRAVELING SALESMAN PROBLEM (TSP) and showed that it is NP-hard (Theorem 15.43). The TSP is perhaps the best-studied NP-hard combinatorial optimization problem, and there are many techniques which have been applied. We start by discussing approximation algorithms in Sections 21.1 and 21.2.
Bernhard Korte, Jens Vygen
openaire +2 more sources
Today's Traveling Salesman Problem
IEEE Robotics & Automation Magazine, 2010Heterogeneous unmanned aerial vehicles (UAVs) are being developed for several civil and military applications. These vehicles can differ either in their motion constraints or sensing/attack capabilities. This article uses methods from operations research to address a fundamental routing problem involving heterogeneous UAVs. The approach is to transform
Paul Oberlin +2 more
openaire +1 more source
The Traveling Salesman Problem
The Mathematics Teacher, 1972A COMPANY with branches in ten cities hires a man to visit each branch office once to install pencil sharpeners. They may hire him in any of the ten cities and his employment is to be terminated in the tenth city. Where should he be hired and what route should he take to make his total travel a minimum? (The company does not pay his way home.)
openaire +1 more source
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
Navigating financial toxicity in patients with cancer: A multidisciplinary management approach
Ca-A Cancer Journal for Clinicians, 2022Grace Li Smith +2 more
exaly