A largely expository paper connecting assignment problems to optimal transport and Gromov-Wasserstein distances, with a benchmark claiming a multi-start GW heuristic finds near-optimal capacitated QAP solutions; the benchmark evidence is internally inconsistent.
Available: https://proceedings.neurips.cc/paper/2019/hash/fdd5b16fc8134339089ef25b3cf0e588-Abstract.html
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric
A largely expository paper connecting assignment problems to optimal transport and Gromov-Wasserstein distances, with a benchmark claiming a multi-start GW heuristic finds near-optimal capacitated QAP solutions; the benchmark evidence is internally inconsistent.