A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem

@article{Hahn2012ALR,
  title={A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem},
  author={Peter M. Hahn and Yi-Rong Zhu and Monique Guignard-Spielberg and William L. Hightower and Matthew J. Saltzman},
  journal={INFORMS Journal on Computing},
  year={2012},
  volume={24},
  pages={202-209}
}
We apply the level-3 Reformulation Linearization Technique (RLT3) to the Quadratic Assignment Problem (QAP). We then present our experience in calculating lower bounds using an essentially new algorithm, based on this RLT3 formulation. This algorithm is not guaranteed to calculate the RLT3 lower bound exactly, but approximates it very closely and reaches it in some instances. For Nugent problem instances up to size 24, our RLT3-based lower bound calculation solves these problem instances… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS
16 Citations
22 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, Kluwer Academic Publishers, Dordrecht, The Netherlands

  • H. D. Sherali, W. P. Adams
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…