Tuesday, 13:45 - 14:10 h, Room: H 2038

 

Uwe Truetsch
A "smart'' choice of a relaxation for the quadratic assignment problem within a branch-and-bound framework

Coauthors: Etienne de Klerk, Renata Sotirov

 

Abstract:
The practical approach to calculate an exact solution for a quadratic assignment problem (QAP) via a branch-and-bound framework depends strongly on a "smart'' choice of different strategies within the framework, for example the branching strategy, heuristics for the upper bound or relaxations for the lower bound. In this work, we compare different relaxations from the literature, in particular two promising semidefinite programming relaxations introduced by Zhao, Karisch, Rendl and Wolkowicz, and by Peng, Zhu, Luo and Toh respectively. The aim of our work is to generate and present a size-dependent choice of an appropriate relaxation that can be successfully used at a given node within a branch-and-bound framework.

 

Talk 2 of the invited session Tue.2.H 2038
"Applications of semidefinite programming" [...]
Cluster 4
"Conic programming" [...]

 

  Payday Loans In Missouri. In this section we give only a brief summary recommendation for admission of Levitra Sale. Full information can be found in the instructions for receiving medications with vardenafil.