An SDP-based approach for computing the stability number of a graph
Year of publication: |
2022
|
---|---|
Authors: | Gaar, Elisabeth ; Siebenhofer, Melanie ; Wiegele, Angelika |
Published in: |
Mathematical methods of operations research : ZOR. - Berlin : Springer, ISSN 1432-5217, ZDB-ID 1459420-1. - Vol. 95.2022, 1, p. 141-161
|
Subject: | Branch and bound | Combinatorial optimization | Lovász theta function | Semidefinite programming | Stable set | Mathematik | Mathematics | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
An efficient semidefinite programming relaxation for the graph partition problem
Sotirov, Renata, (2014)
-
Lower bounds for the bandwidth problem
Rendl, Franz, (2021)
- More ...
-
Improving ADMMs for solving doubly nonnegative programs through dual factorization
Cerulli, Martina, (2021)
-
Strong SDP based bounds on the cutwidth of a graph
Gaar, Elisabeth, (2024)
-
A scaleable projection‐based branch‐and‐cut algorithm for the p‐center problem
Gaar, Elisabeth, (2022)
- More ...