Abstract
Purchase PDF (572 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (13)
Purchase PDF (1120 K)
doi:10.1016/S0166-218X(97)00129-7 
Copyright © 1998 Published by Elsevier Science B.V.
Contribution
On the quality of local search for the quadratic assignment problem
Available online 19 June 1998.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Local search is widely used to solve approximately NP-complete combinatorial optimization problems. But, little is known about quality of obtained local minima, for a given neighborhood. We concentrate on one of the most difficult optimization problems, the Quadratic Assignment Problem, and we give an upper bound for the quality of solutions obtained with deepest local search. Moreover, other recently established results on the traveling salesman problem, the graph bipartitioning problem and the maximum independent set problem can be deduced as particular cases.
Author Keywords: Local search; Quadratic assignment problem; Maximum independent set
