A new lower bound for the quadratic assignment problem

Authors:
Paolo Carraresi;Federico Malucelli
Affiliations:
-;-
Venue:
Operations Research - Supplement
Year:
1992

Citing 0
Cited 7

Solving Large Quadratic Assignment Problems in Parallel

Computational Optimization and Applications
On the Applicability of Lower Bounds for Solving RectilinearQuadratic Assignment Problems in Parallel

Computational Optimization and Applications
Efficient Genetic Algorithms Using Simple Genes Exchange LocalSearch Policy for the Quadratic Assignment Problem

Computational Optimization and Applications
Iterated fast local search algorithm for solving quadratic assignment problems

Robotics and Computer-Integrated Manufacturing
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

Discrete Applied Mathematics
Multistart tabu search and diversification strategies for the quadratic assignment problem

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Some applications of nonnegative linear systems: Farkas strikes again

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract