A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem

The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater than 25 are still considered to be large scale. Current successful solution techniques use branch-and-bound methods, which rely on obtaining strong and inexpens...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematics of operations research Ročník 34; číslo 4; s. 1008 - 1022
Hlavní autoři:	Ding, Yichuan, Wolkowicz, Henry
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Linthicum INFORMS 01.11.2009 Institute for Operations Research and the Management Sciences
Témata:	Analysis Assignment problem Branch & bound algorithms Comparative analysis Eigenvalues interior point methods Interior points large-scale problems Mathematical inequalities Mathematical permutation Mathematical theorems Mathematical vectors Matrices Objective functions quadratic assignment problem Quadratic programming Relaxation methods (Mathematics) semidefinite programming relaxations Studies United States
ISSN:	0364-765X, 1526-5471
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!