Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777213 | Electronic Notes in Discrete Mathematics | 2016 | 4 Pages |
Abstract
In this paper we propose a new lower bounding procedure for the Quadratic Assignment Problem based on a generalization of the well-known Gilomore-Lawler procedure for a higher order reformulation. Computational results on some benchmark instances show the strength of the new approach compared with other lower bounds.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Borzou Rostami, Federico Malucelli,