combinatorial-problems: A number of data structures to represent and allow the manipulation of standard combinatorial problems, used as test problems in computer science.
|Versions||0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5|
|Dependencies||array (>=0.2.0.0), base (>=2.0 && <=5), containers (>=0.2.0.1), parsec (>=3.1.1), random (>=126.96.36.199) [details]|
|Copyright||Copyright (c) 2011 Richard Senington|
|Uploaded||by RichardSenington at Wed Jun 29 07:35:08 UTC 2011|
|Downloads||1960 total (21 in the last 30 days)|
|Rating||2.0 (votes: 1) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
In computer science there are a number of standard test problems that are used for testing algorithms, especially those related to Artificial Intelligence and Operations Research. Online there are a number of repositories for collections of known interesting problems, for example the TSPLIB at http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/ and the SATLIB at http://www.satlib.org/.
This library seeks to provide implementations of data structures to store these problems, along with functions for manipulating the problems and routines to load problem files from various sources.
At present it supports TSP/TSPLIB, SAT/SATLIB and TIM (format used by the International Timetabling Competition,
which has been run twice at current date), however it is hoped that the loading routines
can be expanded and the range of problems expanded to cover problems like scheduling and more general timetabling.
The internal data structures make heavy use of the
Data.Map library and
Data.Array. It is not currently
using unboxed values. The library does not use the
bytestring library for loading and saving data either,
which will probably need to be changed later.
For package maintainers and hackage trustees