A Reformulation Scheme and New Lower Bounds for the QAP.

Paolo Carraresi Federico Malucelli

Published in: Quadratic Assignment and Related Problems (1993)

Keyphrases

lower bound
quadratic assignment problem
upper bound
objective function
polynomial approximation
branch and bound
combinatorial optimization
np hard
vc dimension
neural network
scheduling problem
worst case
tabu search
upper and lower bounds
detection scheme
concept class
search algorithm