New lower bounds for the quadratic assignment problem QAP are presented. These bounds are based on the orthogonal relaxation of QAP. The additional improvement is obtained by making efficient use of a tractable representation of orthogonal matrices having constant row and column sums. The new bound is easy to implement and often provides high quality bounds under an acceptable computational effort.
No takes yet. Share an insight, caveat, or question.
Hadley et al. (1992) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: