Location of Repository

Data Correcting Algorithms in Combinatorial Optimization

By Boris Goldengorin, Diptesh Ghosh and Sierksma Gerard


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.

OAI identifier:

Suggested articles



  1. (1977). Accelerated Greedy Algorithms for Maximizing Submodular Set Functions,
  2. (1975). An Eļ¬ƒcient Branch and Bound Algorithm for the Warehouse Location Problem,
  3. (1996). Maximizing a Submodular Function by Integer Programming: Polyhedral Results for the Quadratic Case,
  4. (1989). On the Exact Solution of Large-Scale Simple Plant Location Problems.
  5. (1983). Submodular Functions and Convexity,
  6. (1995). TSPLIB 95, http://www.iwr.uni-heidelberg.de/iwr/ comopt/soft/TSPLIB95/TSPLIB.html,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.