This is a preview. Log in through your library . Abstract The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater ...

This is a preview. Log in through your library . Abstract This paper proposes a decomposition method to compute a lower bound for unconstrained quadratic zero-one minimization. First, we show that any ...