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...
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 ...
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...
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...
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...