The use of special graphs for obtaining lower bounds in the geometric quadratic assignment problem

In this paper we define a class of edge-weighted graphs having nonnega­ tively valued bisections. We show experimentally that complete such graphs with more than three vertices and also some special graphs with only positive edges can be applied to improve the existing lower bounds for a version of the quadratic assignment problem, namely with a matrix composed of rectilinear distances between points in the Euclidean space.

[1]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

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

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

[4]  Jadranka Skorin-Kapov,et al.  A Constructive Method for Improving Lower Bounds for a Class of Quadratic Assignment Problems , 1994, Oper. Res..

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

[6]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[7]  Franz Rendl,et al.  A New Lower Bound Via Projection for the Quadratic Assignment Problem , 1992, Math. Oper. Res..

[8]  Franz Rendl,et al.  Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem , 1992, Math. Program..

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

[10]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[11]  G. S. Palubetski.  A generator of test quadratic assignment problems with known optimal solution , 1990 .

[12]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[13]  Warren P. Adams,et al.  Improved Linear Programming-based Lower Bounds for the Quadratic Assignment Proglem , 1993, Quadratic Assignment and Related Problems.

[14]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..