University of Twente Student Theses
A Disjunctive Programming Approach to the Quadratic Assignment Problem Using Benders' Decomposition
van der Linden, D.M. (2024) A Disjunctive Programming Approach to the Quadratic Assignment Problem Using Benders' Decomposition.
|
PDF
1MB |
| Abstract: | The first version of the quadratic assignment problem (QAP) was posed by Koopmans and Beckmann in 1957. Despite the vast number of publications on the QAP, many small instances are not yet solved to optimality. Some of the most effective modern methods for solving the QAP stem from the Kaufman-Broeckx linearization. In order to advance which QAP instances can be solved, a new method for solving the QAP is proposed. This method has been derived using disjunctive programming, and Benders' decomposition. This method uses mixed integer programming and branch and cut, and this method is closely related to the Kaufman-Broeckx linearization. A prototype of the proposed method is evaluated computationally. |
| Item Type: | Essay (Master) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 31 mathematics |
| Programme: | Applied Mathematics MSc (60348) |
| Link to this item: | https://purl.utwente.nl/essays/100070 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page