scholarly journals Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem

Computation ◽  
2015 ◽  
Vol 3 (2) ◽  
pp. 285-298 ◽  
Author(s):  
Anja Fischer ◽  
Frank Fischer ◽  
Gerold Jäger ◽  
Jens Keilwagen ◽  
Paul Molitor ◽  
...  
Keyword(s):  
Traveling Salesman Problem ◽  
Exact Algorithms ◽  
Traveling Salesman ◽  
Splice Sites ◽  
Rna Splice Sites

scholarly journals Exact algorithms for the Equitable Traveling Salesman Problem

2017 ◽  
Vol 261 (2) ◽  
pp. 475-485 ◽  
Author(s):  
Joris Kinable ◽  
Bart Smeulders ◽  
Eline Delcour ◽  
Frits C.R. Spieksma
Keyword(s):  
Traveling Salesman Problem ◽  
Exact Algorithms ◽  
Traveling Salesman

scholarly journals Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem

2018 ◽  
Vol E101.D (3) ◽  
pp. 611-612
Author(s):  
Mohd SHAHRIZAN OTHMAN ◽  
Aleksandar SHURBEVSKI ◽  
Hiroshi NAGAMOCHI
Keyword(s):  
Traveling Salesman Problem ◽  
Exact Algorithms ◽  
Traveling Salesman ◽  
Polynomial Space

scholarly journals Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics

2014 ◽  
Vol 166 ◽  
pp. 97-114 ◽  
Author(s):  
A. Fischer ◽  
F. Fischer ◽  
G. Jäger ◽  
J. Keilwagen ◽  
P. Molitor ◽  
...  
Keyword(s):  
Traveling Salesman Problem ◽  
Exact Algorithms ◽  
Traveling Salesman

Exact algorithms for the traveling salesman problem with draft limits

2014 ◽  
Vol 235 (1) ◽  
pp. 115-128 ◽  
Author(s):  
Maria Battarra ◽  
Artur Alves Pessoa ◽  
Anand Subramanian ◽  
Eduardo Uchoa
Keyword(s):  
Traveling Salesman Problem ◽  
Exact Algorithms ◽  
Traveling Salesman ◽  
The Traveling Salesman Problem

The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization

2012 ◽  
pp. 342-352
Author(s):  
Gilbert Laporte
Keyword(s):  
Combinatorial Optimization ◽  
Vehicle Routing ◽  
Traveling Salesman Problem ◽  
Vehicle Routing Problem ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Exact Algorithms ◽  
Traveling Salesman ◽  
Routing Problem ◽  
The Traveling Salesman Problem

The Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP) are two of the most popular problems in the field of combinatorial optimization. Due to the study of these two problems, there has been a significant growth in families of exact and heuristic algorithms being used today. The purpose of this paper is to show how their study has fostered developments of the most popular algorithms now applied to the solution of combinatorial optimization problems. These include exact algorithms, classical heuristics and metaheuristics.

Grafos hamiltonianos aplicado al turismo de Panamá

2019 ◽  
Vol 7 (1) ◽  
pp. 109-113
Author(s):  
Julio Trujillo
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman

Un problema clásico de Teoría de Grafos es encontrar un camino que pase por varios puntos, sólo una vez, empezando y terminando en un lugar (camino hamiltoniano). Al agregar la condición de que sea la ruta más corta, el problema se convierte uno de tipo TSP (Traveling Salesman Problem). En este trabajo nos centraremos en un problema de tour turístico por la ciudad de Panamá, transformándolo a un problema de grafo de tal manera que represente la situación planteada.

Sign in / Sign up

Export Citation Format

Share Document