ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • 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.
    Source: SOR '13 proceedings (Str. 373-378)
    Type of material - conference contribution
    Publish date - 2013
    Language - english
    COBISS.SI-ID - 16754009