The Euclidean Matching Problem

DOI10.1007/978-3-319-46577-7zbMath1358.82006OpenAlexW2538063109MaRDI QIDQ2822804

Gabriele Sicuro

Publication date: 5 October 2016

Published in: Springer Theses (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-46577-7

zbMATH Keywords

graphhypergraphcombinatorial optimizationcavity methodMonge-Kantorovich transport problemEuclidean optimizationEuclidean matching problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to statistical mechanics (82-02)

Related Items (3)

On the quadratic random matching problem in two-dimensional domains ⋮ Average optimal cost for the Euclidean TSP in one dimension ⋮ Quantum optimal transport is cheaper

This page was built for publication: The Euclidean Matching Problem