A simple proof of the Parisi and Coppersmith-Sorkin formulas for the random assignment problem, Linkping Studies in Mathematics 6 (2005). A Bilinear Programming Formulation Frieze [5] re-formulated the 3-dimensional planar problem as Minimise n∑ i,j,k=1 C (0)

by J Wästlund
Venue:Choose y0, z0 arbitrarily; Z0 = C(y0, z0); i = 0. 2. Repeat until Zi+1 = Zi. • Let yi+1 maximise C(y, zi). • Let zi+1 maximise C(yi+1, z). • Zi+1 = C(yi+1, zi+1). • i = i+ 1