| Naslov: | Copositive and semidefinite relaxations of the quadratic assignment problem |
|---|
| Avtorji: | Povh, Janez (Avtor)
Rendl, Franz (Avtor) |
|---|
| Datoteke: |  http://dx.doi.org/10.1016/j.disopt.2009.01.002
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Delo ni kategorizirano (r6) |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | FL - Fakulteta za logistiko
|
|---|
| Opis: | 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 |
|---|
| Leto izida: | 2009 |
|---|
| Št. strani: | str. 231-241 |
|---|
| Številčenje: | Vol. 6, iss. 3 |
|---|
| UDK: | 519.85 |
|---|
| COBISS_ID: | 15143001  |
|---|
| ISSN pri članku: | 1572-5286 |
|---|
| NUK URN: | URN:SI:UM:DK:FCHQ0ZVW |
|---|
| Število ogledov: | 687 |
|---|
| Število prenosov: | 75 |
|---|
| Metapodatki: |     |
|---|
| Področja: | Ostalo
|
|---|
|
:
|
|
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
|
|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
