The Haskell Combinatorial Problems Project

Project Summary

This project is a support project for the work on implementing meta-heuristics in Haskell. To experiment with meta-heuristics, availability of optimisation problems is vital. Rather than continually invent new data structures and loading routines a standard library seems to be a reasonable plan.

This allows other people in the field to use this library to rapidly gain access to the problems themselves, to test code distributed by other researchers, and ideally improve on the internal representations for the benefit of everyone.

Currently it only supports SAT-3 and TSP, but I am working to expand that.

Related Projects

Project Members

page last updated : 2011/03/06