combinatorial-problems: A number of data structures to represent and allow the manipulation of standard combinatorial problems, used as test problems in computer science.

[ library, optimisation ] [ Propose Tags ]

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 and the SATLIB at

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.


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5
Dependencies array (>=, base (>=2.0 && <=5), bytestring (>=, bytestring-lexing (>=0.2.1), containers (>=, parsec (>=3.1.1), random (>= [details]
License LicenseRef-GPL
Copyright Copyright (c) 2011 Richard Senington
Author Richard Senington
Category Optimisation
Home page
Uploaded by RichardSenington at 2013-07-18T16:38:24Z
Reverse Dependencies 2 direct, 0 indirect [details]
Downloads 4120 total (13 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]