A branch-and-cut algorithm for the connected max-k-cut problem
Year of publication: |
2024
|
---|---|
Authors: | Healy, Patrick ; Jozefowiez, Nicolas ; Laroche, Pierre ; Marchetti, Franc ; Martin, Sébastien ; Róka, Zsuzsanna |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 312.2024, 1 (1.1.), p. 117-124
|
Subject: | Branch-and-cut | Combinatorial optimization | Connectivity | Integer programming | Max-cut | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Theorie | Theory | Scheduling-Verfahren | Scheduling problem |
-
Silva, Allyson, (2021)
-
Exact approaches for the minimum subgraph diameter problem
Dadalto, Arthur Pratti, (2023)
-
Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
Sinnl, Markus, (2022)
- More ...
-
Khoury, Nabil, (1990)
-
Nouvelle configuration de la vie politique en Italie
Laroche, Pierre, (1995)
-
Italie: la classe dirigeante à la reconquête de la société
Laroche, Pierre, (1994)
- More ...