3016 search results - page 63 / 604 » The Online Transportation Problem |
114
Voted
SIAMDM
1998
15 years 3 months ago
1998
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
128
Voted
STOC
1991
ACM
15 years 7 months ago
1991
ACM
In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-pl...
256
Voted
DFG
2009
Springer
15 years 10 months ago
2009
Springer
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra’s...
145
Voted
AINA
2004
IEEE
15 years 7 months ago
2004
IEEE
The interconnection of software components is a key to enabling collaborative work. However, technology differences and security barriers like firewalls often hinder establishing ...
87
Voted
SIAMMA
2011
14 years 10 months ago
2011
In this paper, we introduce a notion of barycenter in the Wasserstein space which generalizes McCann’s interpolation to the case of more than two measures. We provide existence,...