On optimal matching measures for matching problems related to 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 two different multiples of the Euclidean distance that each measure is transported...
Guardado en:
| Autores principales: | Mazón, J.M., Rossi, J.D., Toledo, J. |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_08627959_v139_n4_p553_Mazon |
| Aporte de: |
Ejemplares similares
-
On optimal matching measures for matching problems related to the euclidean distance
por: Rossi, Julio Daniel
Publicado: (2014) -
An optimal matching problem for the Euclidean distance
por: Mazón, J.M., et al. -
An optimal transportation problem with a cost given by the Euclidean distance plus import/export taxes on the boundary
por: Mazón, J.M., et al. -
An optimal matching problem for the Euclidean distance
por: Rossi, Julio Daniel
Publicado: (2014) -
Mass transport problems for the Euclidean distance obtained as limits of p-Laplacian type problems with obstacles
por: Mazón, J.M., et al.