1. A method for partitioning a call center having N agents associated with M agent groups, for computation by a plurality of computational nodes, comprising the steps of (a) assigning each agent as a vertex in a hypergraph; (b) assigning each agent group as a hyper-edge in the; and (c) applying a hypergraph partitioning algorithm to partition the agents and groups relative to the nodes with the hypergraph cost function awarding equal load distribution to nodes and minimizing inter-node traffic.