A Lower Bound on the Expected Cost of an Optimal Assignment
From MaRDI portal
Publication:5287981
DOI10.1287/moor.18.2.267zbMath0779.90066MaRDI QIDQ5287981
Muralidharan S. Kodialam, Michel X. Goemans
Publication date: 5 August 1993
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.18.2.267
90C35: Programming involving graphs or networks
90C05: Linear programming
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment, Asymptotic behavior of the expected optimal value of the multidimensional assignment problem, Random assignment problems, Asymptotics in the random assignment problem, The ?(2) limit in the random assignment problem, Unnamed Item