Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

Adaptation of the Rounding Search-Based Algorithm for the k-Clustering Minimum Completion Problem

Abstract : This study proposes an algorithm based upon the rounding strategy for the k-clustering minimum completion problem. An instance of the problem is defined in a complete bipartite graph of S and C vertices. The goal of the problem is to decompose the initial graph into k-clusters, where each cluster is a complete bipartite subgraph. Since the problem is NP hard, any exact solver, like Cplex, is often not sufficient to achieve solutions with relatively hight quality. Thus, we propose a first alternative solution procedure for tackling large-scale instances. The designed method can be viewed as a special variant of the rounding search-based algorithm and it can be applied for solving several complex optimization problems. The proposed algorithm is evaluated on a set of benchmark instances related to the k-clustering minimum completion problem, where its achieved results are compared to the best results available in the literature.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

https://hal-u-picardie.archives-ouvertes.fr/hal-03617889
Contributeur : Louise DESSAIVRE Connectez-vous pour contacter le contributeur
Soumis le : mercredi 23 mars 2022 - 18:08:08
Dernière modification le : vendredi 5 août 2022 - 11:25:00

Identifiants

  • HAL Id : hal-03617889, version 1

Collections

Citation

Mhand Hifi, S. Sadeghsa. Adaptation of the Rounding Search-Based Algorithm for the k-Clustering Minimum Completion Problem. 2020 7TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT'20), VOL 1, Jun 2020, Prague, Czech Republic. pp.1150-1155. ⟨hal-03617889⟩

Partager

Métriques

Consultations de la notice

5