Name
Abstract | ||
|---|---|---|
We investigate the classical Gilmore-Lawler lower bound for the quadratic assignment problem. We provide evidence of the difficulty of improving the Gilmore-Lawler bound and develop new bounds by means of optimal reduction schemes. Computational results are reported indicating that the new lower bounds have advantages over previous bounds and can be used in a branch-and-bound type algorithm for the quadratic assignment problem. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/BF02085649 | Annals OR |
Keywords | DocType | Volume |
Quadratic assignment problem,branch-and-bound,lower bound,combinatorial optimization,AMS(MOS) 68Q25,90B80,90C27 | Journal | 50 |
Issue | ISSN | Citations |
1 | 1572-9338 | 21 |
PageRank | References | Authors |
3.34 | 13 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Y. Li | 1 | 21 | 3.34 |
| Panos M. Pardalos | 2 | 698 | 98.99 |
| K. G. Ramakrishnan | 3 | 587 | 98.53 |
| Mauricio G. C. Resende | 4 | 3729 | 336.98 |