This archive is distributed in association with the INFORMS Journal on Computing under the MIT License.
The software and data in this repository are a snapshot of the software and data that were used in the research reported on in the paper Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem by V.Maniezzo. This paper was awarded the INFORMS Journal of Computing Test of Time Paper Award for 1996-2000. Some 25 years later, V. Maniezzo found the associated code on a hard drive, and so we make the code available here for historical interest.
To cite the contents of this repository, please cite both the paper and this repo, using their respective DOIs.
https://doi.org/10.1287/ijoc.11.4.358
https://doi.org/10.1287/ijoc.11.4.358.cd
Below is the BibTex for citing this snapshot of the repository.
@misc{Maniezzo1999,
author = {V. Maniezzo},
publisher = {INFORMS Journal on Computing},
title = {{Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem}},
year = {1999},
doi = {10.1287/ijoc.11.4.358.cd},
url = {https://github.com/INFORMSJoC/11.4.358},
note = {Available for download at https://github.com/INFORMSJoC/11.4.358},
}
The code and data in this repository are those left on my hard disk at the time of publication. The original code is in Fortran, a language I can no longer use. I moved to ANSI C immediately afterwards, and there are actually two translations, but they are post-publication works, possibly incomplete.
The fortran code makes use of R.E. Burkard's linear assignment routine for which I can find no reference, but it is cited in the paper.
Besdes the results reported in the paper, I found one results table contained in an Excel file that I include in the results section of the repository.
I am currently unable to reproduce the tests as I have never used Fortran since. However, I will be happy to include instructions on how to rebuild the code using widely available open source Windows compilers.