par Figueiredo, Rosa;Frota, Yuri;Labbé, Martine 
Référence Lecture notes in computer science, 7997 LNCS, page (266-271)
Publication Publié, 2013
Référence Lecture notes in computer science, 7997 LNCS, page (266-271)
Publication Publié, 2013
Article révisé par les pairs
| Résumé : | A signed graph G = ( V , E , s ) is k -balanced if V can be partitioned into at most k sets in such a way that positive edges are found only within the sets and negative edges go between sets. We study the problem of finding a subgraph of G that is k -balanced and maximum according to the number of vertices. This problem has applications in clustering problems appearing in collaborative x conflicting environments. We describe a 0-1 linear programming formulation for the problem and implement a first version of a branch-and-cut algorithm based on it. GRASP metaheuristics are used to implement the separation routines in the branch-and-cut. We also propose GRASP and ILS-VND procedures to solve heuristically the problem. © 2013 Springer-Verlag. |
