A New Lower Bound for the Quadratic Assignment Problem

Paolo Carraresi and Federico Malucelli
Additional contact information
Paolo Carraresi: University of Pisa, Pisa, Italy
Federico Malucelli: University of Pisa, Pisa, Italy

Operations Research, 1992, vol. 40, issue 1-supplement-1, S22-S27

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: facilities; location: applications; programming; quadratic: assignment; lower bound (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.40.1.S22 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:40:y:1992:i:1-supplement-1:p:s22-s27

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().