An exact branch‐and‐bound procedure for the quadratic‐assignment problem

M. S. Bazaraa and A. N. Elshafei

Naval Research Logistics Quarterly, 1979, vol. 26, issue 1, 109-121

Abstract: The quadratic‐assignment problem is a difficult combinatorial problem which still remains unsolved. In this study, an exact branch‐and‐bound procedure, which is able to produce optimal solutions for problems with twelve facilities or less, is developed. The method incorporates the concept of stepped fathoming to reduce the effort expended in searching the decision trees. Computational experience with the procedure is presented.

Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800260111

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:26:y:1979:i:1:p:109-121

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().