Schreier-Sims割满足独立集：处理对称性时保持问题结构
Schreier-Sims Cuts meet Stable Set: Preserving Problem Structure when Handling Symmetries
摘要：
对称处理不等式是整数规划中处理对称性的常用工具。尽管他们在实践中的成功应用，只有很少有人知道的互动SHIs与最优化问题。在这篇文章中，我们专注于SST削减，一类有吸引力的SHI，并调查其计算和多面体后果的最优化问题。在表明它们不会增加求解最优化问题的计算复杂性后，我们专注于独立集问题，我们推导出基于SST切割的预求解技术。此外，我们得到加强版本的SST削减和确定的情况下，这些不平等的独立集多面体增加保持完整性。初步的计算实验表明，我们的技术有很大的潜力，以减少独立集问题的大小和解决它们的时间。
英文摘要：
Symmetry handling inequalities (SHIs) are a popular tool to handle symmetries in integer programming. Despite their successful application in practice, only little is known about the interaction of SHIs with optimization problems. In this article, we focus on SST cuts, an attractive class of SHIs, and investigate their computational and polyhedral consequences for optimization problems. After showing that they do not increase the computational complexity of solving optimization problems, we focus on the stable set problem for which we derive presolving techniques based on SST cuts. Moreover, we derive strengthened versions of SST cuts and identify cases in which adding these inequalities to the stable set polytope maintains integrality. Preliminary computational experiments show that our techniques have a high potential to reduce both the size of stable set problems and the time to solve them.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
