Improved Discrete Reformulations for the Quadratic Assignment Problem
This paper presents an improved as well as a completely new version of a mixed integer linear programming (MILP) formulation for solving the quadratic assignment problem (QAP) to global optimum. Both formulations work especially well on instances where at least one of the matrices is sparse. Modification schemes, to decrease the number of unique elements per row in symmetric instances, are presented as well. The modifications will tighten the presented formulations and considerably shorten the computational times. We solved, for the first time ever to proven optimality, the instance esc32b from the quadratic assignment problem library, QAPLIB.
KeywordsCombinatorial optimization Quadratic assignment problem Mixed integer programming Global optimization
Unable to display preview. Download preview PDF.
- 2.de Carvalho Jr., S., Rahmann, S.: Microarray layout as a quadratic assignment problem. In: Proceedings of the German Conference on Bioinformatics (GCB). Lecture Notes in Informatic, vol. P-83, pp. 11–20 (2006)Google Scholar
- 8.Eschermann, B., Wunderlich, H.J.: Optimized synthesis of self-testable finite state machines. In: 20th International Symposium on Fault-Tolerant Computing, FTCS-20. Digest of Papers, pp. 390–397 (June 1990)Google Scholar
- 10.Çela, E.: The Quadratic Assignment Problem Theory and Algorithms. Kluwer Academic Publishers (1998)Google Scholar