275 search results - page 36 / 55 » The Attractive Traveling Salesman Problem |
204
click to vote
Book
"Introduction to Neural Networks fpr C#, Second Edition, introduces the C# programmer to the world of Neural Networks and Artificial Intelligence. Neural network architectures...
LION
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we introduce the variable fitness function which can be used to control the search direction of any search based optimisation heuristic where more than one objective ...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We present randomized approximation algorithms for multicriteria Max-TSP. For Max-STSP with k > 1 objective functions, we obtain an approximation ratio of 1 k - for a...
MOR
2006
14 years 9 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...