50 search results - page 9 / 10 » Iterative patching and the asymmetric traveling salesman pro... |
AAIM
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
STACS
2009
Springer
14 years 25 days ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
CCO
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
ANOR
2004
13 years 6 months ago
2004
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...