Optimal matching problems with costs given by Finsler distances
In this paper we deal with an optimal matching problem, that is, we want to transport two commodities (modeled by two measures that encode the spacial distribution of each commodity) to a given location, where they will match, minimizing the total transport cost that in our case is given by the sum...
Guardado en:
| Autor principal: | Rossi, Julio Daniel |
|---|---|
| Publicado: |
2015
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15340392_v14_n1_p229_Mazon http://hdl.handle.net/20.500.12110/paper_15340392_v14_n1_p229_Mazon |
| Aporte de: |
Ejemplares similares
-
Optimal matching problems with costs given by Finsler distances
por: Mazón, J.M., et al. -
An optimal matching problem for the Euclidean distance
por: Rossi, Julio Daniel
Publicado: (2014) -
An optimal matching problem for the Euclidean distance
por: Mazón, J.M., et al. -
Optimal mass transportation for costs given by Finsler distances via p-Laplacian approximations
por: Igbida, N., et al. -
Optimal mass transportation for costs given by Finsler distances via p-Laplacian approximations
Publicado: (2018)