A branch‐and‐bound‐based heuristic for solving the quadratic assignment problem
- 1 June 1983
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 30 (2), 287-304
- https://doi.org/10.1002/nav.3800300210
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Contributions to the quadratic assignment problemEuropean Journal of Operational Research, 1980
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problemNaval Research Logistics Quarterly, 1980
- A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problemPublished by Springer Nature ,1980
- An exact branch‐and‐bound procedure for the quadratic‐assignment problemNaval Research Logistics Quarterly, 1979
- Numerical investigations on quadratic assignment problemsNaval Research Logistics Quarterly, 1978
- Hospital Layout as a Quadratic Assignment ProblemJournal of the Operational Research Society, 1977
- Note—On the Use of Fictitious Bounds in Tree Search AlgorithmsManagement Science, 1977
- An Algorithm for the Quadratic Assignment ProblemManagement Science, 1970
- The Optimal Assignment of Facilities to Locations by Branch and BoundOperations Research, 1966
- Optimal and Suboptimal Algorithms for the Quadratic Assignment ProblemJournal of the Society for Industrial and Applied Mathematics, 1962