On Solving a Hard Quadratic 3-Dimensional Assignment Problem

  • Hans D Mittelmann
  • Domenico Salvagnin
    • Categories Branch and Cut Algorithms, Telecommunications Tags , , Short URL: https://optimization-online.org/?p=12589

    We address the exact 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 proven 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 eff ort (2.5 million nodes and one week of computations on a standard PC).

    Article

    Download

    View On Solving a Hard Quadratic 3-Dimensional Assignment Problem