Data correcting algorithms for combinatorial optimization

Abstract

This paper describes data correcting algorithms. It provides the theory behind the algorithms and presents the implementation details and computational experience with these algorithms on the asymmetric traveling salesperson problem, the problem of maximizing submodular functions, and the simple plant location problem.