Computational Results For Various Error Localisation Algorithms

Over the last few years several algorithms for solving the so-called error localisation problem have been developed at Statistics Netherlands. For six data sets involving numerical data we present computational results for four of those algorithms in this paper. The algorithms are based on a standard mixed integer programming formulation, on the generation of the vertices of a certain polyhedron by means of an adapted version of Chernikova’s algorithm, on a branch-and-bound algorithm using Fourier-Motzkin elimination, and on a cutting plane approach.