Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
| Year of publication: |
2023
|
|---|---|
| Authors: | Belyi, Alexander ; Sobolevsky, Stanislav ; Kurbatski, Alexander ; Ratti, Carlo |
| Published in: |
Mathematical methods of operations research : ZOR. - Berlin : Springer, ISSN 1432-5217, ZDB-ID 1459420-1. - Vol. 98.2023, 2, p. 269-297
|
| Subject: | Branch and bound | Clique partitioning problem | Clustering | Community detection | Exact solution | Graphs | Linear programming | Modularity | Upper bounds | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Graphentheorie | Graph theory |
-
Enumeration of the facets of cut polytopes over some highly symmetric graphs
Deza, Michel, (2016)
-
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi, (2022)
-
An SDP-based approach for computing the stability number of a graph
Gaar, Elisabeth, (2022)
- More ...
-
Sobolevsky, Stanislav, (2014)
-
Xu, Yang, (2021)
-
Merging transport network companies and taxis in Curitiba’s BRT system
Medeiros, Rafael Milani, (2023)
- More ...