A New Lower Bound for the Quadratic Assignment Problem

DOI10.1287/opre.40.1.S22zbMath0755.90083OpenAlexW1972445234MaRDI QIDQ3990559

Federico Malucelli, Paolo Carraresi

Publication date: 28 June 1992

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.40.1.s22

zbMATH Keywords

branch-and-bound algorithmquadratic assignmentlower bounds

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Lower bounds for the quadratic assignment problem, A new exact algorithm for the solution of quadratic assignment problems, A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem, A survey for the quadratic assignment problem, Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation, The quadratic cycle cover problem: special cases and efficient bounds, A parallel depth first search branch and bound algorithm for the quadratic assignment problem, The quadratic shortest path problem: complexity, approximability, and solution methods, Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing, Lower bounds based on linear programming for the quadratic assignment problem, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, The linearization problem of a binary quadratic problem and its applications, 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, Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems, A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method, A revised reformulation-linearization technique for the quadratic assignment problem, QAPLIB-A quadratic assignment problem library