where for any $F \subseteq V,d(j,F) = \min _{feF} d(j,f)$ . This is a "min-max" or "robust" version of the k-median problem. Note that in contrast to the recent ...
The Journal of the Operational Research Society, Vol. 66, No. 9 (SEPTEMBER 2015), pp. 1430-1441 (12 pages) In the multi-depot vehicle routing problem (MDVRP), there are several depots where vehicles ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback