On solving a hard quadratic 3-dimensional assignment problem

Hans Mittelmann, Domenico Salvagnin

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


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 mixed-integer 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 1 week of computations on a standard PC).

Original languageEnglish (US)
Pages (from-to)219-234
Number of pages16
JournalMathematical Programming Computation
Issue number2
StatePublished - Jun 18 2015


  • Mixed-integer programming
  • Quadratic assignment
  • Symmetry

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software


Dive into the research topics of 'On solving a hard quadratic 3-dimensional assignment problem'. Together they form a unique fingerprint.

Cite this