236 search results - page 40 / 48 » On the Vehicle Routing Problem with lower bound capacities |
126
click to vote
SOCO
2010
Springer
14 years 6 months ago
2010
Springer
Until recently, local governments in Spain were using machines with rolling cylinders for verifying taximeters. However, the condition of the tires can lead to errors in the proces...
133
click to vote
PODS
1995
ACM
15 years 3 months ago
1995
ACM
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...
STACS
2009
Springer
15 years 6 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
SODA
2001
ACM
15 years 1 months ago
2001
ACM
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
106
click to vote
COMSWARE
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capaci...