NUK - logo
VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Application of polynomial approximation hierarchy to quadratic assignment problem
    Dickinson, Peter J. C., 1985- ; Povh, Janez, 1973-
    We demonstrate how to use a very general and powerful approximation hierarchy for general polynomial optimization problems to get strong and tractable lower bounds for the well-known Quadratic ... assignment problem. We show that the first members of this hierarchy give linear and semidefinite programming bounds comparable with the strongest bounds from the literature.
    Vir: SOR '13 proceedings (Str. 373-378)
    Vrsta gradiva - prispevek na konferenci
    Leto - 2013
    Jezik - angleški
    COBISS.SI-ID - 16754009