On the number of k-cycles in the assignment problem for random matrices
DOI10.1088/1742-5468/2008/03/P03019zbMATH Open1456.82498OpenAlexW3098760203MaRDI QIDQ5239474FDOQ5239474
Authors: Fernando Falceto, J. G. Esteve 
Publication date: 22 October 2019
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/1742-5468/2008/03/p03019
Recommendations
- On the expected number of assignments in reduced matrices for the linear assignment problem
- scientific article; zbMATH DE number 1802784
- Certain expected values in the random assignment problem
- The probabilistic relationship between the assignment and asymmetric traveling salesman problems.
- Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
Probability distributions: general theory (60E05) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Stochastic methods applied to problems in equilibrium statistical mechanics (82B31)
Cites Work
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Matching theory
- Title not available (Why is that?)
- The \(\zeta(2)\) limit in the random assignment problem
- The Traveling Salesman Problem with Distances One and Two
- A proof of Parisi's conjecture on the random assignment problem
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- Title not available (Why is that?)
- On Random Symmetric Travelling Salesman Problems
- The probabilistic relationship between the assignment and asymmetric traveling salesman problems.
- Exact solution of the random bipartite matching model
Cited In (1)
This page was built for publication: On the number of \(k\)-cycles in the assignment problem for random matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239474)
