Partitioning through projections : strong SDP bounds for large graph partition problems
Year of publication: |
2023
|
---|---|
Authors: | Meijer, Frank de ; Sotirov, Renata ; Wiegele, Angelika ; Zhao, Shudian |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 151.2023, p. 1-20
|
Subject: | Graph partition problems | Semidefinite programming | Cutting planes | Dykstra's projection algorithm | Augmented Lagrangian methods | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Projektmanagement | Project management | Ganzzahlige Optimierung | Integer programming |
-
A network simplex method for the budget-constrained minimum cost flow problem
Holzhauser, Michael, (2017)
-
Maximizing engagement in large-scale social networks
Kroger, Samuel, (2024)
-
A wide branching strategy for the graph coloring problem
Morrison, David Robert, (2014)
- More ...
-
Meijer, Frank de, (2021)
-
Integrality and cutting planes in semidefinite programming approaches for combinatorial optimization
Meijer, Frank de, (2023)
-
An efficient semidefinite programming relaxation for the graph partition problem
Sotirov, Renata, (2014)
- More ...