This paper presents an approximation scheme for the Kantorovich-Rubinstein mass transshipment (KR) problem on compact spaces. A sequence of finite-dimensional linear programs, minimal cost network flow problems with bounds, are introduced and it is proven that the limit of the sequence of the optimal values of these problems is the optimal value of the KR problem. Numerical results are presented approximating the Kantorovich metric between distributions on [0,1].
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.