VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
Celotno besedilo
  • 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.
    Vir: SOR '03 proceedings (Str. [53-58])
    Vrsta gradiva - prispevek na konferenci ; neleposlovje za odrasle
    Leto - 2003
    Jezik - angleški
    COBISS.SI-ID - 512167543