Abstract
In this paper a surprising probabilistic behaviour of quadratic sum assignment problems is shown. The relative difference between worst and optimal solution value tends to zero with probability tending to one as the size of the problem goes to infinity. This result suggests that for high dimensional quadratic assignment problems even very simple approximation algorithms can in practice yield good suboptimal solutions.
Original language | English |
---|---|
Pages (from-to) | 73-81 |
Journal | Zeitschrift für Operations-Research |
Volume | 27 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1983 |