最大加权 co-2-plex 问题的扩展形式
Extended formulations for the maximum weighted co-2-plex problem
AI总结:
本文提出了一种扩展形式用于最大加权 co-2-plex 问题,通过多面体特性分析和有效不等式生成,提升了求解效率。
摘要:
给定一个输入图及其顶点上的权重,最大 co-2-plex 问题是在图中寻找一个顶点子集,使其权重之和最大,并且诱导图的度数不超过1。本文分析了最大 co-2-plex 问题的多面体特性。已知 co-2-plex 与一个称为 utter 图的辅助图的稳定集存在双射关系~\cite{dupontbouillard2024contractions}。我们利用这种双射关系,将收缩完美图的 co-2-plex 多面体在扩展空间中进行表征。结果表明,所关联的线性系统的总对偶整理性也表征了输入图的收缩完美性。\n通过将此扩展空间形式投影,我们获得了树的 co-2-plex 多面体的自然变量空间描述。此投影产生了一族新的有效不等式用于 co-2-plex 多面体,并且我们确定了这些不等式何时定义为面。此外,我们证明这些不等式可以在多项式时间内分离。我们还确定了哪些图的此形式描述了一个整数多面体。\n这些线性系统被扩展为最大 co-2-plex 问题的有效整数线性规划(ILP)形式,其线性松弛值比该问题的当前最佳状态更紧~\cite{bala}。最后,我们提供了几种我们新 ILP 形式的实现与该问题当前最佳 ILP 的实验比较,并分析了它们相对于输入图密度的性能。
英文摘要:
Given an input graph and weights on its vertices, the maximum co-2-plex problem is to find a subset of vertices maximizing the sum of their weights and inducing a graph of degree at most 1. In this article, we analyze polyhedral aspects of the maximum co-2-plex problem. The co-2-plexes of a graph are known to be in bijection with the stable sets of an auxiliary graph called the utter graph~\cite{dupontbouillard2024contractions}. We use this bijection to characterize contraction perfect graphs' co-2-plex polytopes in an extended space. It turns out that the total dual integrality of the associated linear system also characterizes contraction perfectness of the input graph. By projecting this extended space formulation, we obtain the natural variable space description of the co-2-plex polytopes of trees. This projection yields a new family of valid inequalities for the co-2-plex polytope and we characterize when they define facets. Moreover, we show that these inequalities can be separated in polynomial time. We characterize the graphs for which this formulation describes an integer polytope. These linear systems are extended to valid integer linear programs (ILPs) for the maximum co-2-plex problem whose linear relaxation values are tighter than the state of the art for this problem~\cite{bala}. Finally, we provide an experimental comparison of several implementations of our new ILP formulations with the state-of-the-art ILP for this problem and analyze their respective performances relatively to the density of the input graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。