A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem
- 1 January 1980
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963
- The Quadratic Assignment ProblemManagement Science, 1963
- Optimal and Suboptimal Algorithms for the Quadratic Assignment ProblemJournal of the Society for Industrial and Applied Mathematics, 1962
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955