Skip to main content
Conference Proceedings

A comparison of two dual methods for discrete optimal transport

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 8085 LNCS 389-396
DOI: 10.1007/978-3-642-40020-9_42
9Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The goal of this expository article is to present and compare two dual methods that have been proposed independently for computing solutions of the discrete or semi-discrete instances of optimal transport. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Mérigot, Q. (2013). A comparison of two dual methods for discrete optimal transport. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8085 LNCS, pp. 389–396). https://doi.org/10.1007/978-3-642-40020-9_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free