Copositive and semidefinite relaxations of the quadratic assignment problem

Povzetek

Semidefinite relaxations of the quadratic assignment problem (QAP) have recently turned out to provide good approximations to the optimal value of QAP. We take a systematic look at various conic relaxations of QAP. We first show that QAP can equivalently be formulated as a linear program over the cone of completely positive matrices. Since it is hard to optimize over this cone, we also look at tractable approximations and compare with several relaxations from the literature. We show that several of the well-studied models are in fact equivalent. It is still a challenging task to solve the strongest of these models to reasonable accuracy on instances of moderate size.

Ključne besede

matematično programiranje;problem kvadratičnega prirejanja;kopozitivno programiranje;semidefinitna poenostavitev;quadratic assignment problem;copositive programming;semidefinite relaxations;lift-and-project relaxations;

Podatki

Jezik:	Angleški jezik
Leto izida:	2009
Tipologija:	1.01 - Izvirni znanstveni članek
Organizacija:	UM FL - Fakulteta za logistiko
UDK:	519.85
COBISS:	15143001
ISSN:	1572-5286
Št. ogledov:	28
Št. prenosov:	21
Ocena:	0 (0 glasov)
Metapodatki:

Ostali podatki

Sekundarni jezik:	Neznan jezik
URN:	URN:SI:UM:
Vrsta dela (COBISS):	Delo ni kategorizirano
Strani:	str. 231-241
Letnik:	ǂVol. ǂ6
Zvezek:	ǂiss. ǂ3
Čas izdaje:	2009
ID:	1474263