The Euclidean Matching Problem

DOI10.1007/978-3-319-46577-7MaRDI QIDQ2822804zbMATH OpenOpenAlexFDO

Authors 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

graphcombinatorial optimizationhypergraphMonge-Kantorovich transport problemcavity methodEuclidean optimizationEuclidean matching problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1202983
• The distance matching problem
• An Optimal Matching Problem for the Euclidean Distance
• Publication:4953913
• A matching problem in the plane
• On the Euclidean assignment problem
• On a matching problem in the plane
• Euclidean matching problems and the metropolis algorithm
• The feasible matching problem

Cited in

(13)

• The distance matching problem
• Average optimal cost for the Euclidean TSP in one dimension
• Annealed quantitative estimates for the quadratic 2D-discrete random matching problem
• On a matching problem in the plane
• Correlation function for the grid-Poisson Euclidean matching on a line and on a circle
• Exact solution of the random bipartite matching model
• Quantum optimal transport is cheaper
• The number of optimal matchings for Euclidean assignment on the line
• The random fractional matching problem
• An Optimal Matching Problem for the Euclidean Distance
• On the quadratic random matching problem in two-dimensional domains
• On the Euclidean assignment problem
• Euclidean matching problems and the metropolis algorithm

This page was built for publication: The Euclidean Matching Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822804)