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