An SDP-based approach for computing the stability number of a graph
Year of publication: |
2022
|
---|---|
Authors: | Gaar, Elisabeth ; Siebenhofer, Melanie ; Wiegele, Angelika |
Subject: | Branch and bound | Combinatorial optimization | Lovász theta function | Semidefinite programming | Stable set | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Branch-and-Bound | Branch and Bound |
-
Guimarães, Dilson Almeida, (2020)
-
Enumeration of the facets of cut polytopes over some highly symmetric graphs
Deza, Michel, (2016)
-
Lateness minimization in pairwise connectivity restoration problems
Averbakh, Igor, (2018)
- 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 ...