A New Lower Bound for the Quadratic Assignment Problem

DOI10.1287/OPRE.40.1.S22MaRDI QIDQ3990559zbMATH OpenOpenAlexFDO

Authors 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 algorithmlower boundsquadratic assignment

Mathematics Subject Classification ID

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

Recommendations

• A new lower bound for the quadratic assignment problem
• Lower bounds for the quadratic assignment problem
• Improved lower bounds for the quadratic assignment problem
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• The quadratic assignment problem. I: New lower bounds in paired assignment
• scientific article; zbMATH DE number 4027174
• Lower bounds based on linear programming for the quadratic assignment problem
• scientific article; zbMATH DE number 4143776
• Lower bounds for the quadratic semi-assignment problem
• scientific article; zbMATH DE number 714532

Cited in

(33)

• A new exact algorithm for the solution of quadratic assignment problems
• scientific article; zbMATH DE number 714532 (Why is no real title available?)
• scientific article; zbMATH DE number 714534 (Why is no real title available?)
• The quadratic shortest path problem: complexity, approximability, and solution methods
• The linearization problem of a binary quadratic problem and its applications
• A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem
• scientific article; zbMATH DE number 4027174 (Why is no real title available?)
• scientific article; zbMATH DE number 2049010 (Why is no real title available?)
• An optimal tree search method for the manufacturing systems cell formation problem
• A survey for the quadratic assignment problem
• Network-based formulations of the quadratic assignment problem
• A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
• One-dimensional machine location problems in a multi-product flowline with equidistant locations
• Lower bounds based on linear programming for the quadratic assignment problem
• Bounds for the quadratic assignment problem using the bundle method
• Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
• Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing
• A new lower bound for the quadratic assignment problem
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• scientific article; zbMATH DE number 714531 (Why is no real title available?)
• QAPLIB-A quadratic assignment problem library
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• A parallel depth first search branch and bound algorithm for the quadratic assignment problem
• The quadratic cycle cover problem: special cases and efficient bounds
• The quadratic minimum spanning tree problem: lower bounds via extended formulations
• The quadratic assignment problem. I: New lower bounds in paired assignment
• A generalized Gilmore-Lawler procedure for the quadratic assignment problem
• Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
• A new algorithm for the quasi-assignment problem
• A new bound for the quadratic assignment problem based on convex quadratic programming
• A revised reformulation-linearization technique for the quadratic assignment problem
• Lower bounds for the quadratic assignment problem
• A Constructive Method for Improving Lower Bounds for a Class of Quadratic Assignment Problems

This page was built for publication: A New Lower Bound for the Quadratic Assignment Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990559)