Network-based formulations of the quadratic assignment problem

DOI10.1016/S0377-2217(96)00330-XzbMath0955.90057MaRDI QIDQ1291651

Michael O. Ball, Bharat K. Kaku, Andrew I. Vakhutinsky

Publication date: 22 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

integer programming; network programming; design; facilities

Mathematics Subject Classification ID

90C10: Integer programming

90B10: Deterministic network models in operations research

90B80: Discrete location and assignment

Related Items

A survey for the quadratic assignment problem

Cites Work

• Unnamed Item
• An exact algorithm for the general quadratic assignment problem
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
• A distance assignment approach to the facility layout problem
• An algorithm for the quadratic assignment problem using Benders' decomposition
• A new exact algorithm for the solution of quadratic assignment problems
• The Quadratic Assignment Problem
• A branch-and-bound-based heuristic for solving the quadratic assignment problem
• Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
• A New Lower Bound for the Quadratic Assignment Problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem