Sciweavers

599 search results - page 51 / 120
» The traveling salesman problem
Sort
View
116
Voted
GIS
2007
ACM
15 years 4 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
96
Voted
COMPGEOM
1993
ACM
15 years 4 months ago
Worst-Case Bounds for Subadditive Geometric Graphs
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
Marshall W. Bern, David Eppstein
81
Voted
IWANN
2001
Springer
15 years 5 months ago
A New Approach to Evolutionary Computation: Segregative Genetic Algorithms (SEGA)
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...
Michael Affenzeller
103
Voted
FOCS
2006
IEEE
15 years 6 months ago
Points on Computable Curves
The “analyst’s traveling salesman theorem” of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This re...
Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo
105
Voted
TCS
2010
14 years 11 months ago
Euclidean TSP on two polygons
We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles i...
Jeff Abrahamson, Ali Shokoufandeh