Abstract The stable set problem is a fundamental combinatorial optimisation problem, that is known to be very difficult in both theory and practice. Some of the solution algorithms in the literature are based on 0-1 linear programming formulations. We examine an entire family of such formulations, based on so-called clique and nodal inequalities. As well as proving some theoretical results, we conduct extensive computational experiments. This enables us to derive guidelines on how to choose the right formulation for a given instance.

中文翻译：

---

稳定集问题：重新审视派系和节点不等式

摘要 稳定集问题是一个基本的组合优化问题，在理论上和实践中都非常困难。文献中的一些求解算法基于 0-1 线性规划公式。我们基于所谓的集团和节点不等式检查了整个此类公式。除了证明一些理论结果外，我们还进行了大量的计算实验。这使我们能够得出有关如何为给定实例选择正确配方的指南。