An exact algorithm for the general quadratic assignment problem
DOI10.1016/0377-2217(86)90303-6zbMath0581.90054OpenAlexW2024640194MaRDI QIDQ1067975
Bharat K. Kaku, Gerald L. Thompson
Publication date: 1986
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(86)90303-6
decompositiondesignlinearizationbranch and boundquadratic assignmentlocationlinear assignmentsubproblemsComputational experience
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (11)
Cites Work
- Unnamed Item
- Unnamed Item
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Time-slot assignment for TDMA-systems
- The Quadratic Assignment Problem
- The Backboard Wiring Problem: A Placement Algorithm
- Assignment Problems and the Location of Economic Activities
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies
- Numerical investigations on quadratic assignment problems
- An Algorithm for the Quadratic Assignment Problem
- Tree-search algorithms for quadratic assignment problems
- The Efficiency of Computer Algorithms for Plant Layout
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
This page was built for publication: An exact algorithm for the general quadratic assignment problem