Traveling salesman path problems [PDF]
Mathematical Programming, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lam, F., Newman, A.
openaire +3 more sources
Exploiting planarity in separation routines for the symmetric traveling salesman problem [PDF]
, 2008 At present, the most successful approach for solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut.
Adam N. Letchford +5 more
core +1 more source
Solving the single depot open close multiple travelling salesman problem through a multi-chromosome based genetic algorithm [PDF]
Decision Science LettersThe multiple travelling salesman problem (MTSP) extends the classical travelling salesman problem (TSP) by involving multiple salesman in the solution.
M. Veeresh +2 more
doaj +1 more source
The Solution of some 100-city Travelling Salesman Problems
EURO Journal on Computational Optimization, 2021 A simplex-based FORTRAN code, working entirely in integer arithmetic, has been developed for the exact solution of travelling-salesman problems. The code adds tour-barring constraints as they are found to be violated.
A. Land
doaj +1 more source
Computing compatible tours for the traveling salesman problem [PDF]
, 2010 We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the subtour relaxation, yielding a solution x*, and then find the best tour x-bar that is 'compatible' with x*, where compatible means that every subtour ...
Fortini, M +14 more
core +1 more source
On solving Travelling Salesman Problem with Vertex Requisitions [PDF]
Yugoslav Journal of Operations Research, 2017 We consider the Travelling Salesman Problem with Vertex Requisitions where, for each position of the tour, at most two possible vertices are given. It is known that the problem is strongly NP-hard.
Eremeev Anton V., Kovalenko Yulia V.
doaj +1 more source
An efficient hybrid genetic algorithm for solving truncated travelling salesman problem [PDF]
Decision Science Letters, 2022 This paper considers a practical truncated traveling salesman problem (TTSP), in which the salesman is only required to cover a subset of out of given cities (rather than covering all the given cities as in conventional travelling salesman ...
S. Purusotham +3 more
doaj +1 more source
The centred travelling salesman at high temperature [PDF]
, 2006 A recently formulated statistical mechanics method is used to study the phase transition occurring in a generalisation of the Traveling Salesman Problem (TSP) known as the centred TSP. The method shows that the problem has clear signs of a crossover, but
Lancaster, D.J.
core +1 more source
Penyelesaian Travelling Salesman Problem (TSP) Menggunakan Algoritma Hill Climbing dan MATLAB
Matematika, 2018 Abstrak. Travelling Salesman Problem (TSP) adalah permasalahan dimana seorang salesman harus mengunjungi semua kota yang mana tiap kota hanya dikunjungi sekali, dan harus kembali ke kota asal.
Muhammad Irfan
doaj +1 more source
New techniques for cost sharing in combinatorial optimization games [PDF]
, 2010 Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for such games.
Caprara, A +3 more
core +1 more source