The Data Correcting Algorithm is a branch and bound type algorithm in which the data of a given problem instance is ‘corrected’ at each branching in such a way that the new instance will be as close as possible to a ...