Strong SDP based bounds on the cutwidth of a graph
Year of publication: |
2024
|
---|---|
Authors: | Gaar, Elisabeth ; Puges, Diane ; Wiegele, Angelika |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 161.2024, Art.-No. 106449, p. 1-11
|
Subject: | Combinatorial optimization | Cutwidth | Linear ordering | Semidefinite programming | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem |
-
Guimarães, Dilson Almeida, (2020)
-
Santos, Vinícius Gandra Martins, (2021)
-
The maximum k-colorable subgraph problem and related problems
Kuryatnikova, Olga, (2022)
- More ...
-
Improving ADMMs for solving doubly nonnegative programs through dual factorization
Cerulli, Martina, (2021)
-
An SDP-based approach for computing the stability number of a graph
Gaar, Elisabeth, (2022)
-
A scaleable projection‐based branch‐and‐cut algorithm for the p‐center problem
Gaar, Elisabeth, (2022)
- More ...