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)
• ORLIB, a library of benchmark problems from Operations Research (including scheduling and frequency assignment problems)
• PSPLIB, a library of benchmark problems for project scheduling
• SATLIB, a benchmark library of satisfiability problems, mirrored in North America
• TPTP, a benchmark library for theorem proving
• TSPLIB, a library of traveling salesperson and Hamiltonian circuit problems

Back to CSPLib home page.