about
misc
Solving the n-Queens Problem in Higher Dimension 2024
Publication, Zuse Institute Berlin, Integer Programming, Graph Theory, Chess
We present an integer programming formulation of the n-queens problem in higher dimensions and several strengthenings through additional valid inequalities. Compared to recent benchmarks, we achieve a speedup in computational time between 15-70x over all instances of the integer programs.
arxiv.org/abs/2410.17873