Check a Permutation
Choose a QAPLIB instance, paste a permutation or upload an .sln file, and get its
cost compared with the best known value. Everything runs in your browser.
A file named after the instance (e.g.
tai30a.sln) selects it automatically.
Numbers 1..n separated by spaces, commas or line breaks; 0-based lists and full
.sln files are accepted too.
How the cost is computed
For an instance with matrices a and b (the first and second matrix in the
.dat file) and a permutation p, where p(i) is the
location of facility i:
cost(p) = sum over i, j of a[i][j] * b[p(i)][p(j)]
This is the QAPLIB convention. If your code uses the opposite one, the checker also reports the cost of the inverse permutation.
Use your own instance file
Check against a QAPLIB-format .dat file that is not in the collection (no BKS comparison):