: a problem library for constraints

Maintained by	Brahim Hnich brahim.hnich@ieu.edu.tr	and	Ian Miguel ianm@dcs.st-and.ac.uk
Founded by	Ian P. Gent ipg@dcs.st-and.ac.uk	and	Toby Walsh tw@cse.unsw.edu.au

Kindly sponsored by:

Related Benchmark Libraries

• DIMACS challenge benchmarks in graph colouring, clique finding, and satisfiability.
• Linear 0-1 benchmarks (including tournament scheduling and radar surveillance problems)
• MaScLib, a benchmark library for manufacturing scheduling.
• MIPLIB, a benchmark library of mixed integer programming problems (including scheduling and routing problems)
• MP-TESTDATA, a benchmark library of Mathematical Programming problems (including routing and traveling salesperson problems)
• The OPL Model Library
• OR-Library, a library of benchmark problems from Operations Research.
• PSPLIB, a library of benchmark problems for project scheduling
• SATLIB, a benchmark library of satisfiability problems
• TPTP, a benchmark library for theorem proving
• TSPLIB, a library of traveling salesperson and Hamiltonian circuit problems
• VFLib, a graph matching library.

Back to CSPLib home page.