88 search results - page 12 / 18 » A random-key genetic algorithm for the generalized traveling... |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
GECCO
2003
Springer
14 years 21 days ago
2003
Springer
The rapid advances of genome-scale sequencing have brought out the necessity of developing new data processing techniques for enormous genomic data. Microarrays, for example, can g...
MOR
2006
13 years 7 months ago
2006
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the t...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
COMBINATORICA
2010
13 years 2 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...