Contributions to the quadratic assignment problem
From MaRDI portal
Publication:1142700
DOI10.1016/0377-2217(80)90108-3zbMath0439.90058MaRDI QIDQ1142700
Paolo Toth, Aristide Mingozzi, Nicos Christofides
Publication date: 1980
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(80)90108-3
quadratic assignment problem; logistics; combinatorial optimisation; two-step method; bounding technique; large linear assignment problem; tree search procedures
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
90B10: Deterministic network models in operations research
90B05: Inventory, storage, reservoirs
90C09: Boolean programming
Related Items
Locating cells with bottleneck machines in cellular manufacturing systems, On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem, A survey for the quadratic assignment problem, Contributions to the quadratic assignment problem, Heuristics and their design: A survey, A heuristic procedure for solving the quadratic assignment problem, Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem, A new exact algorithm for the solution of quadratic assignment problems, A convex form of the quadratic assignment problem
Cites Work
- Contributions to the quadratic assignment problem
- The Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
- Numerical investigations on quadratic assignment problems
- An Algorithm for the Quadratic Assignment Problem
- Tree-search algorithms for quadratic assignment problems
- A Review of the Placement and Quadratic Assignment Problems
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem