Results 161 to 170 of about 72,966 (206)
Some of the next articles are maybe not open access.
Time-Dependent Travelling Salesman Problem
OPSEARCH, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bhavani, V., Sundara Murthy, M.
openaire +2 more sources
Traveling Salesman Problem with Clustering
Journal of Statistical Physics, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schneider, Johannes J. +2 more
openaire +1 more source
2017
This chapter is devoted to the Traveling Salesman Problem (TSP), one of the most famous problems of combinatorial optimization. Compact ILP models for this problem have been proposed since a long time, but most of them are not effective for computational purposes.
Giuseppe Lancia, Paolo Serafini
openaire +1 more source
This chapter is devoted to the Traveling Salesman Problem (TSP), one of the most famous problems of combinatorial optimization. Compact ILP models for this problem have been proposed since a long time, but most of them are not effective for computational purposes.
Giuseppe Lancia, Paolo Serafini
openaire +1 more source
2013
The traveling salesman problem (TSP) has commanded much attention from mathematicians and computer scientists specifically because it is so easy to describe and so difficult to solve. In this paper the problem is defined, various solutiona approaches are discussed and some applications are described.
Hoffman K, Padberg M, Rinaldi G
openaire +1 more source
The traveling salesman problem (TSP) has commanded much attention from mathematicians and computer scientists specifically because it is so easy to describe and so difficult to solve. In this paper the problem is defined, various solutiona approaches are discussed and some applications are described.
Hoffman K, Padberg M, Rinaldi G
openaire +1 more source
Computational Experience with an M-Salesman Traveling Salesman Algorithm
Management Science, 1973A formulation of the traveling salesman problem with more than one salesman is offered. The particular formulation has computational advantages over other formulations. Experience is obtained with an exact branch and bound algorithm employing both upper and lower bounds (mean run time for 55 city problems is one minute). Due to the special formulation,
Joseph A. Svestka, Vaughn E. Huckfeldt
openaire +2 more sources
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
Risky traveling salesman problem
European Journal of Operational Research, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Papadakos, Nikolaos +3 more
openaire +2 more sources
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
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
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 +1 more source