高维空间中的n皇后问题
The $n$-Queens Problem in Higher Dimensions
AI总结:
本文研究高维n皇后问题,提出带有效不等式加强的整数规划方法,计算速度较现有基准提升15至70倍,并证明了多个大型实例的最优性,同时探讨了启发式构造解及解的分布。
摘要:
在一个大小为n的d维棋盘上,最多可以放置多少个互不攻击的皇后?高维n皇后问题是著名的n皇后问题的推广。我们对理论结果、界、求解方法以及该问题在离散优化和组合数学领域中的相互关联性进行了全面的综述。我们提出了高维n皇后问题的整数规划公式,并通过附加有效不等式进行了若干加强。与最近的基准相比,我们在整数规划的所有实例上实现了15至70倍的计算时间加速。我们的计算结果证明了许多大型实例的最优性证书。利用所提出的方法打破更多此前未解决的实例是很有可能的。在对偶方面,我们进一步讨论了构造解的启发式方法,这些解在与整数规划比较时被证明是最优的。最后,我们给出了关于解的数量和密度的初步结果。
英文摘要:
How many mutually non-attacking queens can be placed on a d-dimensional chessboard of size n? The n-queens problem in higher dimensions is a generalization of the well-known n-queens problem. We provide a comprehensive overview of theoretical results, bounds, solution methods, and the interconnectivity of the problem within topics of discrete optimization and combinatorics. 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. Our computational results prove optimality of certificates for several large instances. Breaking additional, previously unsolved instances with the proposed methods is likely possible. On the primal side, we further discuss heuristic approaches to constructing solutions that turn out to be optimal when compared to the IP. We conclude with preliminary results on the number and density of the solutions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。