On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem

Publisher Website
Google Scholar
Abstract
This paper uses the formulation of the quadratic assignment problem as that of minimizing a concave quadratic function over the assignment polytope. Cutting plane procedures are investigated for solving this problem. A lower bound derived on the number of cuts needed for termination indicates that conventional cutting plane procedures would require a huge computational effort for the exact solution of the quadratic assignment problems. However, several heuristics which are derived from the cutting planes produce optimal or good quality solutions early on in the search process. An illustrative example and computational results are presented.

This publication has 0 references indexed in Scilit: