Computational results of a semidefinite branch-and-bound algorithm for k-cluster
Year of publication: |
2016
|
---|---|
Authors: | Krislock, Nathan ; Malick, Jérôme ; Roupin, Frédéric |
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. 66.2016, p. 153-159
|
Subject: | Combinatorial optimization | Semidefinite programming | Triangle inequalities | k-cluster problem | k-densest subgraph problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
Branch, bound and remember algorithm for two-sided assembly line balancing problem
Li, Zixiang, (2020)
-
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano, (2021)
- More ...
-
Multicuts and integral multiflows in rings
Bentz, Cédric, (2009)
-
Butelle, Franck, (2016)
-
Multicuts and integral multiflows in rings
Bentz, Cédric, (2009)
- More ...