On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel

The quadratic assignment problem (QAP) belongs to the hard core of NP-hard optimization problems. After almost forty years of research only relatively small instances can be solved to optimality. The reason is that the quality of the lower bounds available for exact methods is not sufficient. Recently, lower bounds based on decomposition were proposed for the so called rectilinear QAP that proved to be the strongest for a large class of problem instances. We investigate the strength of these bounds when applied not only at the root node of a search tree but as the bound function used in a Branch-and-Bound code solving large scale QAPs.

[1]  Jochem Zowe,et al.  A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..

[2]  Federico Malucelli,et al.  A New Lower Bound for the Quadratic Assignment Problem , 1992, Oper. Res..

[3]  F. Rendl,et al.  A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .

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

[5]  Franz Rendl,et al.  QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..

[6]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[7]  S. E. Karisch,et al.  QAPLIB-A quadratic assignment problem library , 1991 .

[8]  Franz Rendl,et al.  Lower bounds for the quadratic assignment problem via triangle decompositions , 1995, Math. Program..

[9]  Jens Clausen,et al.  Joining forces in solving large-scale quadratic assignment problems in parallel , 1997, Proceedings 11th International Parallel Processing Symposium.

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

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

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

[13]  Federico Malucelli,et al.  A Reformulation Scheme and New Lower Bounds for the QAP , 1993, Quadratic Assignment and Related Problems.

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

[15]  J. Zowe,et al.  A combination of the bundle approach and the trust region concept , 1988 .

[16]  G. Finke.  Quadratic Assignment Problems , 1987 .

[17]  Jadranka Skorin-Kapov,et al.  A Constructive Method to Improve Lower Bounds for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[18]  Catherine Roucairol,et al.  A New Exact Algorithm for the Solution of Quadratic Assignment Problems , 1994, Discret. Appl. Math..

[19]  Jens Clausen,et al.  Solving Large Quadratic Assignment Problems in Parallel , 1997, Comput. Optim. Appl..

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

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

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

[23]  M. Bazaraa,et al.  A branch-and-bound-based heuristic for solving the quadratic assignment problem , 1983 .