The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
This paper is motivated by operating self service transport systems
that flourish nowadays. In cities where such systems have been set
up with bikes, trucks travel to maintain a suitable number of bikes
per station.
It is natural to study a version of the C-delivery TSP defined by
Chalasani and Motwani in which, unlike their definition, C is part
of the input: each vertex v of a graph G=(V,E) has a certain
amount xv of a commodity and wishes to have an amount equal to
yv (we assume that and all
quantities...
This paper is motivated by operating self service transport systems
that flourish nowadays. In cities where such systems have been set
up with bikes, trucks travel to maintain a suitable number of bikes
per station.
It is natural to study a version of the C-delivery TSP defined by
Chalasani and Motwani in which, unlike their definition, C is part
of the input: each vertex v of a graph G=(V,E) has a certain
amount xv of a commodity and wishes to have an amount equal to
yv (we assume that and all
quantities...
Currently displaying 1 –
3 of
3