需要给出多少个线索?最小数独线索问题的双层规划表述
How Many Clues To Give? A Bilevel Formulation For The Minimum Sudoku Clue Problem
AI总结:
本文针对给定已完成数独网格的最小线索数问题(MSCP),提出二元双层线性规划模型与全局有效不等式,在50个9×9数独算例中95%可达最优解,并将模型推广至其他关注解唯一性的组合问题。
摘要:
已有研究表明,任意9×9数独谜题必须包含至少17个线索才能拥有唯一解。本文研究一个更具体的问题:给定一个特定的已完成数独网格,所有以该网格为唯一解的谜题中,最少需要多少个线索?我们将该问题称为最小数独线索问题(Minimum Sudoku Clue Problem, MSCP)。我们将MSCP建模为一个二元双层线性规划,提出一类全局有效不等式,并对50个9×9数独网格的MSCP算例开展了计算研究。使用通用双层求解器,我们求解了95%的算例并得到最优解,同时证明加入适量不等式可提升求解效率。最后,我们将所提模型推广至其他关注解的唯一性的组合问题。
英文摘要:
It has been shown that any 9 by 9 Sudoku puzzle must contain at least 17 clues to have a unique solution. This paper investigates the more specific question: given a particular completed Sudoku grid, what is the minimum number of clues in any puzzle whose unique solution is the given grid? We call this problem the Minimum Sudoku Clue Problem (MSCP). We formulate MSCP as a binary bilevel linear program, present a class of globally valid inequalities, and provide a computational study on 50 MSCP instances of 9 by 9 Sudoku grids. Using a general bilevel solver, we solve 95% of instances to optimality, and show that the solution process benefits from the addition of a moderate amount of inequalities. Finally, we extend the proposed model to other combinatorial problems in which uniqueness of the solution is of interest.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。