A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets
Mathematical Programming: Series A and B
Solving Large Quadratic Assignment Problems in Parallel
Computational Optimization and Applications
Pruning by Isomorphism in Branch-and-Cut
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
Mathematical Programming: Series A and B
Assignment Problems
Mathematical Programming: Series A and B
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Computers and Operations Research
Mathematical Programming: Series A and B
Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
Mathematical Programming: Series A and B
| Hi-index | 0.00 |
We address the exact solution of the famous esc instances of the quadratic assignment problem. These are extremely hard instances that remained unsolved---even allowing for a tremendous computing power---by using all previous techniques from the literature. During this challenging task we found that three ideas were particularly useful and qualified as a breakthrough for our approach. The present paper is about describing these ideas and their impact in solving esc instances. Our method was able to solve, in a matter of seconds or minutes on a single PC, all easy cases (all esc16* plus esc32e and esc32g). The three very hard instances esc32c, esc32d, and esc64a were solved in less than half an hour, in total, on a single PC. We also report the solution, in about five hours, of tai64c. By using a facility-flow splitting procedure, we were also able to solve to proven optimality, for the first time, esc32h (in about two hours) as well as “the big fish” esc128. (To our great surprise, the solution of the latter required just a few seconds on a single PC.)