On solving a hard quadratic 3-dimensional assignment problem

Abstract We address the solution of a very challenging (and previously unsolved) instance of the quadratic 3-dimensional assignment problem, arising in digital wireless communications. The paper describes the techniques developed to solve this instance to optimality, from the choice of an appropriate mixedinteger programming formulation, to cutting planes and symmetry handling. Using these techniques we were able to solve the target instance with moderate computational effort (2.5 million nodes and one week of computations on a standard PC). Keywords : Mixed-Integer Programming, Quadratic Assignment, Symmetry

• Type: Journal
• Year: 2015
• Where: MPC
• Authors: Hans D. Mittelmann, Domenico Salvagnin
• Keywords: Mathematics, MPC 2015