A Lagrangian relaxation algorithm for sparse quadratic assignment problems
- 31 March 1995
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 17 (2) , 69-76
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- QAPLIB-A quadratic assignment problem libraryEuropean Journal of Operational Research, 1991
- Allocating modules to processors in a distributed systemIEEE Transactions on Software Engineering, 1989
- An Exact Algorithm for the Quadratic Assignment Problem on a TreeOperations Research, 1989
- Quadratic assignment problemsEuropean Journal of Operational Research, 1984
- A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor SystemIEEE Transactions on Software Engineering, 1981
- Validation of subgradient optimizationMathematical Programming, 1974
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- A quadratic assignment problem without column constraintsNaval Research Logistics Quarterly, 1969
- The Quadratic Assignment ProblemManagement Science, 1963
- Assignment Problems and the Location of Economic ActivitiesEconometrica, 1957