The maximum balanced subgraph of a signed graph: Applications and solution approaches ?
We discussed three applications that can be solved as instances of the MBSP. We discussed reduction rules to the problem and implemented a pre-processing procedure. We developed an improved version of an existing greedy solution ap-proache. We developed an efficient GRASP procedure. We introduced a set of more difficult instances for one application.
combinatorial optimization balanced signed graph heuristics portfolio analysis community structure