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.
Zusammenfassung
In dieser Arbeit wird ein überraschendes asymptotisches Verhalten von quadratischen Zuordnungsproblemen mit Summenzielfunktion aufgezeigt. Es wird bewiesen, daß der relative Unterschied zwischen schlechtestem und bestem Zielfunktionswert mit Wahrscheinlichkeit gegen 1 nach Null strebt, wenn die Dimension der Probleme gegen Unendlich geht. Aufgrund dieses Resultates kann man erwarten, daß schon sehr einfache Heuristiken für höher-dimensionale Probleme in der Praxis recht gute Näherungslösungen liefern.
Similar content being viewed by others
References
Burkard, R.E.: Some Recent Advances in QAP; Report 81/16, Mathematisches Institut der Universität zu Köln (F.R.G.), Aug. 81 (to appear in Proc. Intern. Congress on Mathematical Programming, Rio de Janeiro, April 6–8, 1981. Ed. by D. Cottle, M.L. Kelmanson and B. Korte, Amsterdam).
Burkard, R.E., andU. Fincke: On Random Quadratic Bottleneck Assignment Problems. Math. Programming23, 1982, 227–232.
-: Probabilistic Asymptotic Properties of some Combinatorial Optimization Problems; Report 82-3, Institut für Mathematik, Universität und Technische Universität Graz, August 1982b.
Burkard, R.E., andK.H. Stratmann: Numerical Investigations on Quadratic Assignment Problems. Nav. Res. Log. Quart.25, 1978, 129–148.
Chernoff, H.: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations. Annals of Math. Stat.23, 1952, 493–507.
Cornuejols, G., G.L. Nemhauser, andL.A. Wolsey: Worst-Case and Probabilistic Analysis of Algorithmns for a Location Problem; Operations Research28, 1980, 847–858.
Karp, R.M.: Reducibility Among Combinatorial Problems. Complexity of Computer Computations. Ed. by R.E. Miller and J.W. Thatcher. New York 1972, 85–104.
—: Probabilistic Analysis of Partitioning Algorithms for the Traveling Salesman Problem in the Plane. Math. of O.R.2, 1977, 209–224.
—: A Patching Algorithm for the Nonsymmetric Traveling Salesman Problem. SIAM J. Comput.8, 1979, 561–573.
Koopmans, T.C., andM.J. Beckmann: Assignment Problems and the Location of Economic Activities. Econometrica25, 1957, 52–76.
Sahni, S., andT. Gonzalez: P-Complete Approximation Problems. J.A.C.M.23, 1976, 555–565.
Slominski, L.: Probabilistic Analysis of Combinatorial Algorithms: A Bibliography with Selected Annotations. Computing28, 1982, 257–267.
Walkup, D.W.: On the Expected Value of a Random Assignment Problem. SIAM J. Comput.8, 1979, 440–442.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Burkard, R.E., Fincke, U. The asymptotic probabilistic behaviour of quadratic sum assignment problems. Zeitschrift für Operations Research 27, 73–81 (1983). https://doi.org/10.1007/BF01916903
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01916903