arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2102.09194math.OCcs.DM
收藏

最大加权诱导森林和树木:新公式和计算比较评论

Maximum weighted induced forests and trees: New formulations and a computational comparative review

Rafael A. Melo, Celso C. Ribeiro

摘要:

给定一个图$G=(V,E)$,每个顶点$v\in V$都有一个权值$w_v$,最大加权诱导森林问题(MWIF)包含遇到顶点的一个最大加权子集$V'\subseteq V$,使得$V'$诱导森林.这个NP难问题被认为是等价于最小加权反馈顶点集问题,它在各种领域都有应用。另一方面,密切相关的最大加权诱导树问题(MWIT)要求子集$V'\subseteq V$诱导树。我们提出了两个新的整数规划配方与指数数量的限制和分支和切割程序的MWIF。使用基准实例的计算实验进行比较几个配方,包括新提出的方法和文献中提供的,当解决了一个标准的商业混合整数规划求解器。更具体地,比较了五种制剂,两种紧凑型(即,具有多项式数量的变量和约束)1个和具有指数数量的约束的另外3个。实验表明,一个新的配方的问题的基础上有向割集不等式消除周期(DCUT)提供了更强的线性松弛界的搜索过程中的早期。结果还表明,另一个新的配方,表示树与循环消除(TCYC),优于那些在文献中,当涉及到的平均时间证明最优性的小实例,特别是更具挑战性的。此外,该公式可以实现更低的平均时间来解决可以最佳解决的较大的随机实例。此外,我们展示了MWIF的配方可以很容易地扩展到MWIT。这样的扩展允许我们比较两个问题的最优解值。

英文摘要:

Given a graph $G=(V,E)$ with a weight $w_v$ associated with each vertex $v\in V$, the maximum weighted induced forest problem (MWIF) consists of encountering a maximum weighted subset $V'\subseteq V$ of the vertices such that $V'$ induces a forest. This NP-hard problem is known to be equivalent to the minimum weighted feedback vertex set problem, which has applicability in a variety of domains. The closely related maximum weighted induced tree problem (MWIT), on the other hand, requires that the subset $V'\subseteq V$ induces a tree. We propose two new integer programming formulations with an exponential number of constraints and branch-and-cut procedures for MWIF. Computational experiments using benchmark instances are performed comparing several formulations, including the newly proposed approaches and those available in the literature, when solved by a standard commercial mixed integer programming solver. More specifically, five formulations are compared, two compact (i.e., with a polynomial number of variables and constraints) ones and the three others with an exponential number of constraints. The experiments show that a new formulation for the problem based on directed cutset inequalities for eliminating cycles (DCUT) offers stronger linear relaxation bounds earlier in the search process. The results also indicate that the other new formulation, denoted tree with cycle elimination (TCYC), outperforms those available in the literature when it comes to the average times for proving optimality for the small instances, especially the more challenging ones. Additionally, this formulation can achieve much lower average times for solving the larger random instances that can be optimally solved. Furthermore, we show how the formulations for MWIF can be easily extended for MWIT. Such extension allowed us to compare the optimal solution values of the two problems.

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

↑