A co-designed feasible-space local search heuristic for QAP that exploits single-shot neighborhood evaluation on IMC hardware while preserving feasibility.
Note that by the definition (4.1), the elements in this neighbour are related by the equalities z∗ 1 = j ¯z1 n k · n + mod(¯z2, n) and z∗ 2 = j ¯z2 n k · n + mod(¯z1, n)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Hardware-Compatible Single-Shot Feasible-Space Heuristics for Solving the Quadratic Assignment Problem
A co-designed feasible-space local search heuristic for QAP that exploits single-shot neighborhood evaluation on IMC hardware while preserving feasibility.