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. 53, No. 10, Special Issue: Applications and Developments in Mathematical Programming (Oct., 2002), pp. 1109-1117 (9 pages) In the min-max loop ...
Researchers from MIT, Yale University, and the University of Southern California have developed what they are labeling the "fastest known algorithm" for solving the problem of "maximum flow." The max ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback