English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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. We show that such a problem has a solution with an optimal matching measure supported in the target set. This result can be proved by an approximation procedure using a p−Laplacian system. We prove that any optimal matching measure for this problem is supported on the boundary of the target set when the two multiples that affect the Euclidean distances involved in the cost are different. Moreover, we present simple examples showing uniqueness or nonuniqueness of the optimal measure.

On optimal matching measures for matching problems related to the Euclidean distance