Towards optimal running times for optimal transport
Year of publication: |
2024
|
---|---|
Authors: | Blanchet, Jose ; Jambulapati, Arun ; Kent, Carson ; Sidford, Aaron |
Published in: |
Operations research letters : a journal of INFORMS devoted to the rapid publication of concise contributions in operations research. - Amsterdam [u.a.] : Elsevier Science, ISSN 0167-6377, ZDB-ID 1467065-3. - Vol. 52.2024, Art.-No. 107054, p. 1-8
|
Subject: | Kantorovich problem | Matrix balancing | Maximum cardinality bipartite matching | Optimal transport | Packing LP | Wasserstein distance | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research |
-
Optimal-transport satisficing with applications to capacitated hub location
Hu, Jie, (2024)
-
Stochastic optimization with decision-dependent distributions
Drusvyatskiy, Dmitriy, (2023)
-
Sample out-of-sample inference based on Wasserstein distance
Blanchet, Jose, (2021)
- More ...
-
Efficient simulation of tail probabilities of sums of correlated lognormals
Asmussen, Soren, (2010)
-
Blanchet, Jose, (2010)
-
Efficient rare-event simulation for perpetuities
Blanchet, Jose, (2012)
- More ...