A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- 1 August 1998
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 108 (3) , 629-640
- https://doi.org/10.1016/s0377-2217(97)00063-5
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- QAPLIB-A quadratic assignment problem libraryEuropean Journal of Operational Research, 1991
- 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
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problemsEuropean Journal of Operational Research, 1983
- A branch‐and‐bound‐based heuristic for solving the quadratic assignment problemNaval Research Logistics Quarterly, 1983
- On the quadratic assignment problemDiscrete Applied Mathematics, 1983
- Hospital Layout as a Quadratic Assignment ProblemJournal of the Operational Research Society, 1977
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Assignment Problems and the Location of Economic ActivitiesEconometrica, 1957