Results 201 to 210 of about 108,421 (273)
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
A branch‐and‐bound algorithm for the time‐dependent travelling salesman problem
Networks, 2018Given a graph whose arc traversal times vary over time, the Time‐Dependent Travelling Salesman Problem consists of finding a Hamiltonian tour of least total duration.
Anna Arigliano +3 more
semanticscholar +1 more source
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
The travelling salesman problem and adiabatic quantum computation: an algorithm
Quantum Information Processing, 2018An explicit algorithm for the travelling salesman problem is constructed in the framework of adiabatic quantum computation, AQC. The initial Hamiltonian for the AQC process admits canonical coherent states as the ground state, and the target Hamiltonian ...
T. Kieu
semanticscholar +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
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
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