The blind passenger and the assignment problem

DOI10.1017/S0963548311000022MaRDI QIDQ2998855zbMATH OpenFDO

Authors Johan Wästlund

Publication date 11 May 2011

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548311000022

zbMATH Keywords

discrete random processminimum cost assignment

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
• scientific article; zbMATH DE number 1802784
• Certain expected values in the random assignment problem
• The random linear bottleneck assignment problem
• Asymptotics in the random assignment problem

Cites work

• A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
• A proof of Parisi's conjecture on the random assignment problem
• An easy proof of the \(\zeta (2)\) limit in the random assignment problem
• Constructive bounds and exact expectations for the random assignment problem
• Edge cover and polymatroid flow problems
• Exact solution of the random bipartite matching model
• On Random Symmetric Travelling Salesman Problems
• On the expected value of the minimum assignment
• Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
• Size and Weight of Shortest Path Trees with Exponential Link Weights
• The (2) limit in the random assignment problem
• The mean field traveling salesman and related problems

Cited in

(3)

• The absent-minded passengers problem: a motivating challenge solved by computer algebra
• Absent-minded passengers
• The lost boarding pass and other practical problems

This page was built for publication: The blind passenger and the assignment problem

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