33 search results - page 4 / 7 » The Asymmetric Traveling Salesman Problem: Algorithms, Insta... |
DISOPT
2006
13 years 7 months ago
2006
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
ANTSW
2004
Springer
14 years 1 months ago
2004
Springer
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
EMO
2003
Springer
14 years 26 days ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
ACL
2009
13 years 5 months ago
2009
An efficient decoding algorithm is a crucial element of any statistical machine translation system. Some researchers have noted certain similarities between SMT decoding and the f...