论文信息 - A New Lower Bound for the Quadratic Assignment Problem

A New Lower Bound for the Quadratic Assignment Problem

We introduce a new lower bound for the quadratic assignment problem based on a sequence of equivalent formulations of the problem. We present a procedure for obtaining tight bounds by sequentially applying our approach in conjunction with the A. Assad and W. Xu bound and the N. Christofides and M. Gerrard bound.

Federico Malucelli | Paolo Carraresi | P. Carraresi | F. Malucelli

[1] Catherine Roucairol,et al. A parallel branch and bound algorithm for the quadratic assignment problem , 1987, Discret. Appl. Math..

[2] A. Assad,et al. On lower bounds for a class of quadratic 0, 1 programs , 1985 .

[3] Thomas E. Vollmann,et al. An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[4] P. Gilmore. Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[5] Nicos Christofides,et al. A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem , 1981 .

[6] Alan M. Frieze,et al. On the quadratic assignment problem , 1983, Discret. Appl. Math..

[7] R. Burkard. Quadratic Assignment Problems , 1984 .

[8] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.

[9] E. Lawler. The Quadratic Assignment Problem , 1963 .