The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
An algebraic and combinatorial approach to the study of
the Quadratic Assignment Problem produced theoretical results that can
be applied to (meta) heuristics to give them information about the
problem structure, allowing the construction of algorithms. In this
paper those results were applied to inform a Simulated Annealing-type
heuristic (which we called RedInv-SA). Some results from tests with
known literature instances are presented.
Download Results (CSV)