138
click to vote
WEA
15 years 7 months ago
2007 Springer 
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s a...
103
click to vote
WEA
15 years 7 months ago
2007 Springer 
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
103
click to vote
WEA
15 years 7 months ago
2007 Springer 
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...
104
click to vote
WEA
15 years 7 months ago
2007 Springer 
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...
123
click to vote
WEA
15 years 7 months ago
2007 Springer 
We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures...
|
Algorithms