599 search results - page 27 / 120 » The traveling salesman problem |
167
Voted
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract— In this work we focus on mission planning problems in scenarios in which a carrier vehicle, typically slow but with virtually infinite range, and a carried vehicle, wh...
107
Voted
RECOMB
2005
Springer
16 years 24 days ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
102
click to vote
FCS
2006
15 years 1 months ago
2006
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...
135
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
102
Voted
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...