Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
- 1 November 1999
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 11 (4) , 358-369
- https://doi.org/10.1287/ijoc.11.4.358
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian methodEuropean Journal of Operational Research, 1998
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- Comparison of iterative searches for the quadratic assignment problemLocation Science, 1995
- Scatter search and star-paths: beyond the genetic metaphorOR Spectrum, 1995
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the Quadratic Assignment ProblemEuropean Journal of Operational Research, 1995
- A new exact algorithm for the solution of quadratic assignment problemsDiscrete Applied Mathematics, 1994
- A parallel branch and bound algorithm for the quadratic assignment problemDiscrete Applied Mathematics, 1987
- On lower bounds for a class of quadratic 0, 1 programsOperations Research Letters, 1985
- Quadratic assignment problemsEuropean Journal of Operational Research, 1984
- Assignment Problems and the Location of Economic ActivitiesEconometrica, 1957