Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances

Documenti analoghi

• QAP-Router: Tackling Qubit Routing as Dynamic Quadratic Assignment with Reinforcement Learning
  di: Nguyen, Kien X., et al.
  Pubblicazione: (2026)
• Inventory of the 12 007 Low-Dimensional Pseudo-Boolean Landscapes Invariant to Rank, Translation, and Rotation
  di: Liefooghe, Arnaud, et al.
  Pubblicazione: (2026)
• AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
  di: Jha, Piyush, et al.
  Pubblicazione: (2024)
• W2SAT: Learning to generate SAT instances from Weighted Literal Incidence Graphs
  di: Wen, Weihuang, et al.
  Pubblicazione: (2023)
• Learning Solution-Aware Transformers for Efficiently Solving Quadratic Assignment Problem
  di: Tan, Zhentao, et al.
  Pubblicazione: (2024)