Column-generation based bounds for the Homogeneous Areas Problem
We model the organization of a help-desk as a new combinatorial optimization problem. We provide a compact and an extended ILP formulation of the problem. We compute a lower bound with a column generation technique. We compute an upper bound with a Least Discrepancy Search heuristic. We apply the methods to real-world, realistic and random instances.
column generation graph partitioning tabu search