A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- 30 April 2007
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 34 (4), 1085-1106
- https://doi.org/10.1016/j.cor.2005.05.027
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Solving large quadratic assignment problems on computational gridsMathematical Programming, 2002
- QAPLIB – A Quadratic Assignment Problem LibraryJournal of Global Optimization, 1997
- Solving Large Quadratic Assignment Problems in ParallelComputational Optimization and Applications, 1997
- Improved linear programming-based lower bounds for the quadratic assignment problemDIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1994
- REFORMULATING QUADRATIC ASSIGNMENT PROBLEMS FOR EFFICIENT OPTIMIZATIONIIE Transactions, 1993
- An algorithm for the quadratic assignment problem using Bender's decompositionEuropean Journal of Operational Research, 1978
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- An Experimental Comparison of Techniques for the Assignment of Facilities to LocationsOperations Research, 1968
- The Quadratic Assignment ProblemManagement Science, 1963
- Assignment Problems and the Location of Economic ActivitiesEconometrica, 1957