1. A method for partitioning a call center having agents associated with agent groups, for computation by a plurality of computational nodes, comprising: (a) assigning, by a processor, the agents as a vertex in a hypergraph; (b) assigning, by the processor, the agent groups as a hyper-edge in the hypergraph; and (c) applying, by the processor, a hypergraph partitioning algorithm configured to partition the agents and the agent groups relative to the computational nodes with a hypergraph cost function awarding equal load distribution to the computational nodes; (d) mapping, by the processor, the agents and the agent groups as an object to one of the computational nodes by a function, such that each computational node is an owner for the object; (e) for the agents, computing, by the processor, agent aggregates locally by an associated owner node of the computational nodes; and (f) for the agent groups, computing, by the processor, agent group aggregates for each agent group shared by the computational nodes by: i) creating a partial state record of the agent group aggregates by each computational node by aggregating on the agents owned by each computational node and belonging to each agent group; and ii) sending the partial state records to the owner node, which combines the partial state records into a total state record, wherein the partitioning of the call center is for minimizing data traffic between the computational nodes.