An optimal matching problem for the Euclidean distance

We deal with an optimal matching problem, that is, we want to transport two measures to a given place (the target set), where they will match, minimizing the total transport cost that in our case is given by the sum of the Euclidean distance that each measure is transported. We show that such a prob...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Rossi, Julio Daniel
Publicado: 2014
Materias:
Monge-Kantorovich's mass transport theory
Optimal matching problem
P-Laplacian systems
Euclidean distance
Monge-kantorovich's mass transport theories
Optimal matching
P-Laplacian
p-Laplacian systems
Transport costs
Statistical mechanics
Optimization
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00361410_v46_n1_p233_Mazon
http://hdl.handle.net/20.500.12110/paper_00361410_v46_n1_p233_Mazon
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares