Optimal networks by mass transportation via points allocation
classification
🧮 math.OC
math.MG
keywords
problemsmassminimizingnumberobtainedoptimalprescribedtransportation
read the original abstract
It is shown that optimal network plans can be obtained, naturally, as a limit of easier problems of point allocations. These problems are obtained by minimizing the mass transportation on the set of atomic measures of prescribed number of atoms. Each of these problems can be solved by minimizing a function of a finite, prescribed number of variables.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.