The Blind Passenger and the Assignment Problem
From MaRDI portal
Publication:2998855
DOI10.1017/S0963548311000022zbMath1219.90091MaRDI QIDQ2998855
Publication date: 11 May 2011
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
90B80: Discrete location and assignment
Related Items
Cites Work
- The mean field traveling salesman and related problems
- Edge cover and polymatroid flow problems
- An easy proof of the \(\zeta (2)\) limit in the random assignment problem
- A proof of Parisi's conjecture on the random assignment problem
- The ?(2) limit in the random assignment problem
- On the expected value of the minimum assignment
- Size and Weight of Shortest Path Trees with Exponential Link Weights
- Constructive bounds and exact expectations for the random assignment problem
- Exact solution of the random bipartite matching model
- A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
- On Random Symmetric Travelling Salesman Problems
- Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures