86 search results - page 4 / 18 » Approximations for minimum and min-max vehicle routing probl... |
COR
2000
14 years 9 months ago
2000
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
EOR
2007
14 years 9 months ago
2007
Classical vehicle routing problems typically do not consider the impact of delivery price on the demand for delivery services. Existing models seek the minimum sum of tour lengths...
MOBIHOC
2010
ACM
14 years 7 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
74
Voted
SIGCOMM
1999
ACM
15 years 1 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
CIMCA
2005
IEEE
15 years 3 months ago
2005
IEEE
We present some proposals to approximately solve a period vehicle routing problem used to model the extraction of oil from a set of onshore oil wells in Brazil. This problem diffe...