arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1306.5053cs.AIcs.CC
收藏

不同序的对称破缺

Breaking Symmetry with Different Orderings

NICTA(澳大利亚国家信息与通信技术研究院);UNSW(新南威尔士大学)

Nina Narodytska, Toby Walsh

摘要:

我们可以通过消除每个对称类中的解来破坏对称性。例如,Lex-Leader方法消除了字典序中除了最小解之外的所有解。不幸的是,Lex-Leader方法通常是难以处理的。我们证明,在适度的假设下,我们不能减少最坏情况下的复杂性,打破对称性使用其他排序的解决方案。我们还证明,当我们使用词典序的两种有希望的替代方案时,一种常见的对称类型(决策变量矩阵中的行和列是可互换的)很难被打破:格雷码排序(它使用不同的排序)解决方案),和Snake-Lex排序(这是对变量重新排序的词典序的变体)。尽管如此,我们的实验表明,使用其他排序,如格雷码打破对称性可以在实践中是有益的,因为它们可以更好地与目标函数和分支启发式对齐。

英文摘要:

We can break symmetry by eliminating solutions within each symmetry class. For instance, the Lex-Leader method eliminates all but the smallest solution in the lexicographical ordering. Unfortunately, the Lex-Leader method is intractable in general. We prove that, under modest assumptions, we cannot reduce the worst case complexity of breaking symmetry by using other orderings on solutions. We also prove that a common type of symmetry, where rows and columns in a matrix of decision variables are interchangeable, is intractable to break when we use two promising alternatives to the lexicographical ordering: the Gray code ordering (which uses a different ordering on solutions), and the Snake-Lex ordering (which is a variant of the lexicographical ordering that re-orders the variables). Nevertheless, we show experimentally that using other orderings like the Gray code to break symmetry can be beneficial in practice as they may better align with the objective function and branching heuristic.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑