Show simple item record

dc.contributor.authorSolomon, Justin
dc.contributor.editorBruschi, David Edward
dc.contributor.editorFirsching, Moritz
dc.contributor.editorCederbaum, Carla
dc.date.accessioned2018-02-07T15:07:39Z
dc.date.available2018-02-07T15:07:39Z
dc.date.issued2017-12-21
dc.identifier.urihttp://publications.mfo.de/handle/mfo/1332
dc.description.abstractOptimal transport is the mathematical discipline of matching supply to demand while minimizing shipping costs. This matching problem becomes extremely challenging as the quantity of supply and demand points increases; modern applications must cope with thousands or millions of these at a time. Here, we introduce the computational optimal transport problem and summarize recent ideas for achieving new heights in efficiency and scalability.en
dc.language.isoenen
dc.publisherMathematisches Forschungsinstitut Oberwolfachen
dc.relation.ispartofseriesSnapshots of modern mathematics from Oberwolfach;2017,08
dc.rightsAttribution-ShareAlike 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-sa/4.0/*
dc.titleComputational Optimal Transporten
dc.typeArticleen
dc.identifier.doi10.14760/SNAP-2017-008-EN
local.series.idSNAP-2017-008-EN
local.subject.snapshotNumerics and Scientific Computing
dc.identifier.urnurn:nbn:de:101:1-201802278226
dc.identifier.ppn1659214769


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-ShareAlike 4.0 International
Except where otherwise noted, this item's license is described as Attribution-ShareAlike 4.0 International