the graph bisection problem as well as its generalization in the form of the task allocation problem with two processors … (2-TAP). Balanced graph bisection is an NP-complete problem which partitions a set of nodes in the graph G = (N, E) into …. 2-TAP is graph bisection with the addition of node preference costs in the objective function. We transform the general …