VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Solving SDP relaxations of Max-Cut problem with large number of hypermetric inequalities by L-BFGS-B
    Hrga, Timotej ; Povh, Janez, 1973-
    We present a computational study of SDP-based bounds for Max-Cut that use a subset of hypermetric inequalities as cutting planes to strengthen the basic relaxation. Solving these relaxations is ... computationally challenging due to the potentially large number of violated constraints. To overcome these difficulties, we describe a heuristic separation algorithm for hypermetric inequalities and propose to use the augmented Lagrangian method as a bounding routine. Computational experiments show that the resulting relaxations provide very tight bounds for the Max-Cut.
    Vir: Optimization letters. - ISSN 1862-4472 (Vol. 17, iss. 5, June 2023, str. 1201-1213)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2023
    Jezik - angleški
    COBISS.SI-ID - 129106435

    Povezava(-e):

    https://link.springer.com/article/10.1007/s11590-022-01944-z
    DOI

vir: Optimization letters. - ISSN 1862-4472 (Vol. 17, iss. 5, June 2023, str. 1201-1213)
loading ...
loading ...
loading ...

Vnos na polico