[HTML][HTML] Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
A Fischer, F Fischer, G Jäger, J Keilwagen… - Discrete Applied …, 2014 - Elsevier
In this paper we introduce an extension of the Traveling Salesman Problem (TSP), which is
motivated by an important application in bioinformatics. In contrast to the TSP the costs do …
motivated by an important application in bioinformatics. In contrast to the TSP the costs do …
Relaxed tours and path ejections for the traveling salesman problem
C Rego - European Journal of operational research, 1998 - Elsevier
We describe an edge based ejection chain method to generate compound neighborhood
structures for the Traveling Salesman Problem (TSP). These neighborhood structures …
structures for the Traveling Salesman Problem (TSP). These neighborhood structures …
Minimization and maximization versions of the quadratic travelling salesman problem
The travelling salesman problem (TSP) asks for a shortest tour through all vertices of a
graph with respect to the weights of the edges. The symmetric quadratic travelling salesman …
graph with respect to the weights of the edges. The symmetric quadratic travelling salesman …
The quadratic selective travelling salesman problem
T Thomadsen, TK Stidsen - 2003 - orbit.dtu.dk
A well-known extension of the Travelling Salesman Problem (TSP) is the Selective TSP
(STSP): Each node has an associated profit and instead of visiting all nodes, the most …
(STSP): Each node has an associated profit and instead of visiting all nodes, the most …
Models and algorithms for the traveling salesman problem with time-dependent service times
Abstract The Traveling Salesman Problem with Time-dependent Service times (TSP-TS) is a
generalization of the Asymmetric TSP, in which the service time at each customer is given by …
generalization of the Asymmetric TSP, in which the service time at each customer is given by …
Simple constructive, insertion, and improvement heuristics based on the girding polygon for the Euclidean traveling salesman problem
The Traveling Salesman Problem (TSP) aims at finding the shortest trip for a salesman, who
has to visit each of the locations from a given set exactly once, starting and ending at the …
has to visit each of the locations from a given set exactly once, starting and ending at the …
A polyhedral study of the quadratic traveling salesman problem
A Fischer - … Research Proceedings 2014: Selected Papers of the …, 2016 - Springer
In this paper we summarize some of the results of the author's Ph. D.-thesis. We consider an
extension of the traveling salesman problem (TSP). Instead of each path of two nodes, an …
extension of the traveling salesman problem (TSP). Instead of each path of two nodes, an …
An algorithm for using Excel Solver© for the traveling salesman problem
MC Patterson, B Harmel - Journal of Education for Business, 2003 - Taylor & Francis
Abstract The Traveling Salesman Problem (TSP), well known to operations research
enthusiasts, is one of the most challenging combinatorial optimization problems. In this …
enthusiasts, is one of the most challenging combinatorial optimization problems. In this …
[HTML][HTML] A comprehensive survey on the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an extension of the classical
traveling salesman problem (TSP) and it is among the most researched combinatorial …
traveling salesman problem (TSP) and it is among the most researched combinatorial …
Experimental analysis of heuristics for the STSP
DS Johnson, LA McGeoch - The traveling salesman problem and its …, 2002 - Springer
In this and the following chapter, we consider what approaches one should take when one is
confronted with a real-world application of the TSP. What algorithms should be used under …
confronted with a real-world application of the TSP. What algorithms should be used under …