VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
Celotno besedilo
  • Copositive and semidefinite relaxations of the quadratic assignment problem
    Povh, Janez, 1973- ; Rendl, Franz
    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.
    Vir: Discrete optimization. - ISSN 1572-5286 (Vol. 6, iss. 3, 2009, str. 231-241)
    Vrsta gradiva - članek, sestavni del
    Leto - 2009
    Jezik - angleški
    COBISS.SI-ID - 15143001
vir: Discrete optimization. - ISSN 1572-5286 (Vol. 6, iss. 3, 2009, str. 231-241)
loading ...
loading ...