Network Flows Heuristics for Complementary Cell Suppression: An Empirical Evaluation and Extensions

摘要: Several network flows heuristics have been suggested in the past for solution of complementary suppression problem. However, a limited computational experience using them is reported literature, and, moreover, they were only appropriate two-dimensional tables. The purpose this paper twofold. First, we perform an empirical comparison two heuristics. They are improved versions already existing approaches. Second, show that extensions methods (i.e., multicommodity and with side constraints) can model three-dimensional, hierarchical linked Exploiting structure improve performance any method solely based on linear programming formulations.