Skip to Main content Skip to Navigation
Journal articles

Solving the clique partitioning problem as a maximally diverse grouping problem

Abstract : In this paper we show that the clique partitioning problem can be reformulated in an equivalent form as the maximally diverse grouping problem (MDGP). We then modify a skewed general variable neighborhood search (SGVNS) heuristic that was first developed to solve the MDGP. Similarly as with the MDGP, significant improvements over the state of the art are obtained when SGVNS is tested on large scale instances. This further confirms the usefulness of a combined approach of diversification afforded with skewed VNS and intensification afforded with the local search in general VNS.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03402185
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 3:35:22 PM
Last modification on : Wednesday, November 3, 2021 - 5:24:24 AM

Identifiers

Collections

Citation

Jack Brimberg, Stefana Janićijević, Nenad Mladenovic, Dragan Urošević. Solving the clique partitioning problem as a maximally diverse grouping problem. Optimization Letters, Springer Verlag, 2017, 11 (6), pp.1-13. ⟨10.1007/s11590-015-0869-4⟩. ⟨hal-03402185⟩

Share

Metrics

Record views

11