Asymptotic Moments of the Bottleneck Assignment Problem

Published Online:https://doi.org/10.1287/moor.1110.0493

References

  • Abramowitz M., Stegun I. A.Handbook of Mathematical Functions (1972) (National Bureau of Standards, Washington, DC) Google Scholar
  • Aldous D. J. The ζ(2) limit in the random assignment problem. Random Structures Algorithms (2001) 18:381–418CrossrefGoogle Scholar
  • Bollobás B.Random Graphs (2001) 2nd ed.(Cambridge University Press, Cambridge, UK) CrossrefGoogle Scholar
  • Bollobás B., Thomason A. Random graphs of small order. Ann. Discrete Math. (1985) 28:47–97Google Scholar
  • Burkard R., Dell'Amico M., Martello S. Assignment problems. Society for Industrial and Applied Mathematics (2009) (Philadelphia)CrossrefGoogle Scholar
  • Casella G., Berger R. L.Statistical Inference (1990) (Duxbury Press, Belmont, CA) Google Scholar
  • David H. A., Nagaraja H. N.Order Statistics (2003) 3rd ed.(Wiley-Interscience, Hoboken, NJ) CrossrefGoogle Scholar
  • Erdős P., Rényi A. On random matrices. Publ. Math. Inst. Hungarian Acad. Sci. (1964) 8:455–461Google Scholar
  • Frieze A. Perfect matchings in random bipartite graphs with minimal degree at least 2. Random Structures Algorithms (2005) 26:319–358CrossrefGoogle Scholar
  • Frieze A., Pittel B. Perfect matchings in random graphs with prescribed minimal degree. Mathematics and Computer Science III, Trends in Mathematics (2004) (Birkhäuser Verlag, Basel, Switzerland) 95–132CrossrefGoogle Scholar
  • Gradshteyn I. S., Ryzhik I. M.Table of Integrals, Series, and Products (1980) (Academic Press, Orlando, FL) Google Scholar
  • Graham R. L., Knuth D. E., Patashnik O.Concrete Mathematics (1994) 2nd ed.(Addison-Wesley, Reading, MA) Google Scholar
  • Krokhmal P. A., Pardalos P. M. Random assignment problems. Eur. J. Oper. Res. (2009) 194:1–17CrossrefGoogle Scholar
  • Minc H., Marcus M.Permanents (1984) (Cambridge University Press, Cambridge, UK) CrossrefGoogle Scholar
  • Pferschy U. The random linear bottleneck assignment problem. RAIRO—Oper. Res. (1996) 30(2):127–142CrossrefGoogle Scholar
  • Riordan J., Stein P. R. Arrangements on chessboards. J. Combin. Theory, Ser. A (1972) 12:72–80CrossrefGoogle Scholar
  • Spivey M. Z. Combinatorial sums and finite differences. Discrete Math. (2007) 307(24):3130–3146CrossrefGoogle Scholar
  • Stirzaker D.Elementary Probability (2003) 2nd ed.(Cambridge University Press, Cambridge, UK) CrossrefGoogle Scholar
  • Weisstein E. W.Inverse Erf (2010) . From MathWorld—A Wolfram Web Resource. http://mathworld.wolfram.com/InverseErf.htmlGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.