An optimal matching problem with constraints
We deal with an optimal matching problem with constraints, that is, we want to transport two measures with the same total mass in RN to a given place (the target set), where they will match and in which we have constraints on the amount of matter we can take to points in the target set. This transpo...
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_11391138_v31_n2_p407_Mazon |
| Aporte de: |
Ejemplares similares
-
An optimal matching problem with constraints
Publicado: (2018) -
An optimal matching problem for the Euclidean distance
por: Mazón, J.M., et al. -
Optimal matching problems with costs given by Finsler distances
por: Mazón, J.M., et al. -
On optimal matching measures for matching problems related to the euclidean distance
por: Mazón, J.M., et al. -
An optimal matching problem for the Euclidean distance
por: Rossi, Julio Daniel
Publicado: (2014)