Sciweavers

209 search results - page 36 / 42
» The multi-depot vehicle routing problem with inter-depot rou...
Sort
View
95
Voted
ANOR
2005
102views more  ANOR 2005»
15 years 22 days ago
Locating Active Sensors on Traffic Networks
Sensors are used to monitor traffic in networks. For example, in transportation networks, they may be used to measure traffic volumes on given arcs and paths of the network. This p...
Monica Gentili, Pitu B. Mirchandani
107
Voted
AAAI
2000
15 years 2 months ago
Human-Guided Simple Search
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...
130
Voted
ICPPW
2009
IEEE
14 years 10 months ago
Improvement of Messages Delivery Time on Vehicular Delay-Tolerant Networks
Vehicular Delay-Tolerant Networks (VDTNs) are an application of the Delay-Tolerant Network (DTN) concept, where the movement of vehicles and their message relaying service is used ...
Vasco Nuno da Gama de Jesus Soares, Joel Jos&eacut...
88
Voted
DAGSTUHL
2007
15 years 2 months ago
Approximating min-max k-clustering
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
Asaf Levin
103
Voted
COR
2008
95views more  COR 2008»
15 years 27 days ago
Good triangulations yield good tours
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
Adam N. Letchford, Nicholas A. Pearson