Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:A New SDP Relaxation for the Quadratic Assignment Problem
Speaker:Maximilian John
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Thursday, 31 March 2016
Duration:30 Minutes
Building:E1 4
The quadratic assignment problem (QAP) is one of the hardest combinatorial optimization problems.

Its range of applications is wide, including facility location, keyboard layout, and various other domains.
The key success factor of specialized branch-and-bound frameworks for minimizing QAPs is an efficient implementation of a strong lower bound.
In this talk, we propose a lower-bound preserving transformation of a QAP to a different quadratic problem allowing for small and efficiently solvable SDP relaxations. This transformation is self-tightening in a branch-and-bound process. Experimental evaluations show promising results, in particular for instances with a small width in one of the dimensions.

Name(s):Maximilian John
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
  • Maximilian John, 03/31/2016 12:16 AM
  • Maximilian John, 02/02/2016 09:25 AM -- Created document.