On the expected optimal value of random assignment problems: Experimental results and open questions

This publication has 11 references indexed in Scilit:

• Computational results of an interior point algorithm for large scale linear programming
  Mathematical Programming, 1991
• Probability and statisitics in the service of computer science: illustrations using the assignment problem
  Communications in Statistics - Theory and Methods, 1990
• An implementation of Karmarkar's algorithm for linear programming
  Mathematical Programming, 1989
• The Cavity Method and the Travelling-Salesman Problem
  Europhysics Letters, 1989
• Order statistics and the linear assignment problem
  Computing, 1987
• On the solution of the random link matching problems
  Journal de Physique, 1987
• A new polynomial-time algorithm for linear programming
  Combinatorica, 1984
• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
  Computing, 1982
• On the Expected Value of a Random Assignment Problem
  SIAM Journal on Computing, 1979
• Algorithm and Average-value Bounds for Assignment Problems
  IBM Journal of Research and Development, 1969