The quadratic assignment problem I. new lower bounds in paired assignment

摘要

Lower bounds with polynomial complexity estimates for the quadratic assignment problem are derived for paired assignment via a novel model and, in the general case, via a nonlinear resolving function.