A New Lower Bound for the Quadratic Assignment Problem
From MaRDI portal
Publication:3990559
DOI10.1287/opre.40.1.S22zbMath0755.90083MaRDI QIDQ3990559
Federico Malucelli, Paolo Carraresi
Publication date: 28 June 1992
Published in: Operations Research (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C10: Integer programming
90C60: Abstract computational complexity for mathematical programming problems
90C20: Quadratic programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing, QAPLIB-A quadratic assignment problem library, A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem, A survey for the quadratic assignment problem, A parallel depth first search branch and bound algorithm for the quadratic assignment problem, Network-based formulations of the quadratic assignment problem, One-dimensional machine location problems in a multi-product flowline with equidistant locations, An optimal tree search method for the manufacturing systems cell formation problem, A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method, Lower bounds for the quadratic assignment problem, A new exact algorithm for the solution of quadratic assignment problems, Lower bounds based on linear programming for the quadratic assignment problem
