275 search results - page 27 / 55 » The Attractive Traveling Salesman Problem |
128
click to vote
WSC
1998
15 years 3 months ago
1998
We apply a Reactive Tabu Search (RTS) heuristic within a discrete-event simulation to solve routing problems for Unmanned Aerial Vehicles (UAVs). Our formulation represents this p...
136
click to vote
CSC
2009
15 years 3 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
182
click to vote
CDC
2010
IEEE
14 years 5 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...
115
click to vote
RECOMB
2005
Springer
16 years 2 months 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...
112
click to vote
FCS
2006
15 years 3 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...