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

DOI10.1007/BF01299451zbMath0804.90108MaRDI QIDQ1315447

K. G. Ramakrishnan, Panos M. Pardalos

Publication date: 10 March 1994

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

random variablesinterior point algorithmlarge-scale assignment

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27)

Related Items (6)

Asymptotic properties of random multidimensional assignment problems ⋮ Asymptotic behavior of the expected optimal value of the multidimensional assignment problem ⋮ Maxima and near-maxima of a Gaussian random assignment field ⋮ Random assignment problems ⋮ Constructive bounds and exact expectations for the random assignment problem ⋮ Asymptotic results for random multidimensional assignment problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• Order statistics and the linear assignment problem
• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
• Computational results of an interior point algorithm for large scale linear programming
• An implementation of Karmarkar's algorithm for linear programming
• On the Expected Value of a Random Assignment Problem
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• A More Portable Fortran Random Number Generator
• Algorithm and Average-value Bounds for Assignment Problems

This page was built for publication: On the expected optimal value of random assignment problems: Experimental results and open questions