A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- 1 January 1986
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 13 (5) , 587-600
- https://doi.org/10.1016/0305-0548(86)90052-3
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A branch‐and‐bound‐based heuristic for solving the quadratic assignment problemNaval Research Logistics Quarterly, 1983
- Numerical investigations on quadratic assignment problemsNaval Research Logistics Quarterly, 1978
- Hospital Layout as a Quadratic Assignment ProblemJournal of the Operational Research Society, 1977
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP ApproachOperations Research, 1976
- An Experimental Comparison of Techniques for the Assignment of Facilities to LocationsOperations Research, 1968
- Scheduling to Minimize Interaction CostOperations Research, 1966
- The Quadratic Assignment ProblemManagement Science, 1963
- The Backboard Wiring Problem: A Placement AlgorithmSIAM Review, 1961
- Formal Procedures for Connecting Terminals with a Minimum Total Wire LengthJournal of the ACM, 1957
- Assignment Problems and the Location of Economic ActivitiesEconometrica, 1957