Performance testing of combinatorial solvers with isomorph class instances

Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems to the binate minimum cover problems, including the Haplotype Inference by Pure Parsimony (HIPP) problem. These problems are being solved under different formulations and in different formats. Results of experiments that are reported can be seldom compared and replicated. This paper is not about `the best BCSP solver'. Rather, it is a case study of how the scientific method can be applied to comparing the performance of not only BCSP solvers but also other solvers that address NP-hard problems. The ap

• Type: Conference
• Year: 2007
• Where: EXPCS
• Authors: Franc Brglez, Jason A. Osborne
• Keywords: Bcsp Solvers, Constraint Satisfaction Problems, EXPCS 2007, Problems, Theoretical Computer Science