Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances.
Sébastien VérelSarah L. ThomsonOmar RifkiPublished in: CoRR (2024)
Keyphrases
- quadratic assignment problem
- sat instances
- stochastic local search
- random instances
- satisfiability problem
- sat solvers
- lower bound
- randomly generated
- sat problem
- random sat
- random sat instances
- hybrid genetic algorithm
- tabu search
- max sat
- phase transition
- combinatorial optimization
- computational properties
- np complete
- branch and bound algorithm
- test instances
- temporal logic
- cost function