INCOP is a C++ library of incomplete methods for solving combinatorial optimization problems. Main common heuristics for local search (simulated annealing, tabu list,...) are proposed, as well as GWW (Go with the winners) method hybridized with local search.
Following problems : Binary CSPs, graph coloring, CELAR Frequency assignment problems, Clique Problem can be solved by this library.
Hybridization of GWW (CPAIOR'03)
Library sources : incop1.0 (format tar.gz)
Library documentation (format tar.gz) ------------------------------------------------------------------------------------------------------------------------------
IDW (Intensification Diversification Walk) (CP'04)
Sources of the library : incop1.1 (format tar.gz)
Documentation (format tar.gz)
For any question about this library, you can send an e-mail to Bertrand.Neveu@enpc.fr