<?xml version="1.0" encoding="UTF-8"?>
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title>Computation of Optimal Transport Plans and Wasserstein Distances</dc:title>
  <dc:title>R package transport version 0.15-4</dc:title>
  <dc:description>Solve optimal transport problems. Compute Wasserstein distances (a.k.a. Kantorovitch, Fortet--Mourier, Mallows, Earth Mover's, or minimal L_p distances), return the corresponding transference plans, and display them graphically. Objects that can be compared include grey-scale images, (weighted) point patterns, and mass vectors.</dc:description>
  <dc:type>Software</dc:type>
  <dc:relation>Depends: R (&gt;= 4.1)</dc:relation>
  <dc:relation>Imports: grDevices, graphics, methods, stats, Rcpp (&gt;= 0.12.10),
data.table</dc:relation>
  <dc:relation>LinkingTo: RcppEigen, Rcpp</dc:relation>
  <dc:relation>Suggests: animation, ks, testthat</dc:relation>
  <dc:creator>Dominic Schuhmacher &lt;dominic.schuhmacher@mathematik.uni-goettingen.de&gt;</dc:creator>
  <dc:publisher>Comprehensive R Archive Network (CRAN)</dc:publisher>
  <dc:contributor>Dominic Schuhmacher [aut, cre],
  Björn Bähre [aut] (aha and power diagrams),
  Nicolas Bonneel [aut] (networkflow),
  Carsten Gottschlich [aut] (simplex and shortlist),
  Valentin Hartmann [aut] (semidiscrete1),
  Florian Heinemann [aut] (transport_track and networkflow integration),
  Bernhard Schmitzer [aut] (shielding),
  Jörn Schrieber [aut] (subsampling),
  Timo Wilm [ctb] (wpp)</dc:contributor>
  <dc:rights>GPL (&gt;= 2)</dc:rights>
  <dc:date>2024-09-16</dc:date>
  <dc:format>application/tgz</dc:format>
  <dc:identifier>https://CRAN.R-project.org/package=transport</dc:identifier>
  <dc:identifier>doi:10.32614/CRAN.package.transport</dc:identifier>
</oai_dc:dc>
