ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • Semidefinite relaxation of the bandwidth problem
    Rendl, Franz ; Povh, Janez, 1973-
    This paper is concerned to a semidefinite relaxation of the bandwidth problem. We will show that even though this relaxation includes exponentially many constraints, it could be efficiently solved ... using the interior point methods or the bundle method. We present a new lower bound for the bandwidth of graph and some numerical results, which show that the practical behaviour of the algorithm is better than we could expect from the theoretical guaranty.
    Source: SOR '03 proceedings (Str. [53-58])
    Type of material - conference contribution ; adult, serious
    Publish date - 2003
    Language - english
    COBISS.SI-ID - 512167543