|Test Problems Home|
During the second DIMACS Implementation Challenge a set of instances were chosen to provide the satisfiability benchmarks. These problems can be found at http://dimacs.rutgers.edu/Challenges/index.html.
A large collection of Traveling Salesman test problems is available at http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/TSPLIB95/TSPLIB.html.
A QAP test problem generator with a known optimal solution is available. The Fortran code of this generator can be obtained by sending an e-mail message to firstname.lastname@example.org and in the body of the message put ``send 92006''.
There is a large collection, QAPLIB, of electronically available data instances for the Quadratic Assignment Problem. The data (and the updated best known solution) are available at http://www.diku.dk/users/karisch/qaplib/inst.html.
During the second DIMACS Implementation Challenge a set of 32 graph instances were chosen to provide benchmarks for the Graph Coloring Problem. These problems can be found at http://dimacs.rutgers.edu/Challenges/index.html.
|Test Problem||Description||Gams File|
|1||Quadratic Integer Problem||.gms|
|2||Quadratic Integer Problem||.gms|
|3||Quadratic Assignment Problem||.gms|
|4||Quadratic Assignment Problem||.gms|
|5||Quadratic Assignment Problem||.gms|
|6||Steiner Problems in Graphs||.gms|
|7||Steiner Problems in Graphs||.gms|
|8||Steiner Problems in Graphs||.gms|
|9||Steiner Problems in Graphs||.gms|
|10||Steiner Problems in Graphs||.gms|
Test Problems Home