Effective formulation reductions for the quadratic assignment problem

@article{Zhang2010EffectiveFR,
  title={Effective formulation reductions for the quadratic assignment problem},
  author={Huizhen Zhang and Cesar Beltran-Royo and Miguel Constantino},
  journal={Computers & OR},
  year={2010},
  volume={37},
  pages={2007-2016}
}
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integer linear programming formulation of the QAP, which we call formulation IPQAP-I. We analyze two cases: In the first case, we study the effect of constraint reduction. In the second case, we study the effect of variable reduction in the case of a sparse cost matrix. Computational experiments with a set of 32 QAPLIB… CONTINUE READING