A New Lower Bound for the Quadratic Assignment Problem
- 1 February 1992
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 40 (1-suppleme) , S22-S27
- https://doi.org/10.1287/opre.40.1.s22
Abstract
We introduce a new lower bound for the quadratic assignment problem based on a sequence of equivalent formulations of the problem. We present a procedure for obtaining tight bounds by sequentially applying our approach in conjunction with the A. Assad and W. Xu bound and the N. Christofides and M. Gerrard bound.Keywords
This publication has 0 references indexed in Scilit: