Partitioning signed networks using relocation heuristics, tabu search, and variable neighborhood search.

•A new method for partitioning large signed networks is presented.•It uses Relocation Heuristics, Tabu, and Variable Neighborhood Search Methods.•Tabu partitioning is included to good effect.•The algorithm is efficient and fast.•The value, when using heuristics, of have many restarts is stressed as critically important.