1985
Asymptotic properties of the quadratic assignment problem
Publication
Publication
Mathematics of Operations Research , Volume 10 - Issue 1 p. 43- 58
For the general quadratic assignment problem as well as for a planar version of this problem, we extend earlier work by Burkard and Fincke to prove that the ratio of the maximal to the minimal solution value converges to 1 almost surely. In fact, any solution value can almost surely be written asymptotically as a simple, explicitly given function of the problem size. Theoretical analysis and computational experiments reveal the convergence to be relatively fast.
Additional Metadata | |
---|---|
doi.org/10.1287/moor.10.1.100, hdl.handle.net/1765/11693 | |
Mathematics of Operations Research | |
Organisation | Erasmus School of Economics |
Frenk, H., van Houweninge, M., & Rinnooy Kan, A. (1985). Asymptotic properties of the quadratic assignment problem. Mathematics of Operations Research, 10(1), 43–58. doi:10.1287/moor.10.1.100 |