arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1912.12752cs.DM
收藏

一种求解广义Grundy控制数的整数规划方法

An integer programming approach for solving a generalized version of the Grundy domination number

Manoel Campêlo, Daniel Severín

摘要:

一个图中的顶点序列称为合法控制序列,如果序列中的每个顶点控制至少一个不被它前面的顶点控制的顶点,并且在最后图的所有顶点都被控制。图的Grundy控制数是图的最大合法控制序列的大小。在这项工作中,我们介绍了一个广义版本的Grundy控制问题。我们明确地计算相应的参数的路径和网络图。我们提出整数规划配方的新问题,找到家庭的有效的不平等和进行广泛的计算实验,比较配方,以及测试这些不平等的削减分支和削减框架。我们还设计了一个启发式寻找良好的初始下限和上限和禁忌搜索,提高了初始下限的性能和评估。测试实例包括随机生成的图、结构化图、经典基准测试实例和两个实际应用实例。我们的方法是精确的20-50顶点的图,并提供了良好的解决方案,图形高达10000顶点。

英文摘要:

A sequence of vertices in a graph is called a legal dominating sequence if every vertex in the sequence dominates at least one vertex not dominated by those that precede it, and at the end all vertices of the graph are dominated. The Grundy domination number of a graph is the size of a largest legal dominating sequence. In this work, we introduce a generalized version of the Grundy domination problem. We explicitly calculate the corresponding parameter for paths and web graphs. We propose integer programming formulations for the new problem, find families of valid inequalities and perform extensive computational experiments to compare the formulations as well as to test these inequalities as cuts in a branch-and-cut framework. We also design and evaluate the performance of a heuristic for finding good initial lower and upper bounds and a tabu search that improves the initial lower bound. The test instances include randomly generated graphs, structured graphs, classical benchmark instances and two instances from a real application. Our approach is exact for graphs with 20-50 vertices and provides good solutions for graphs up to 10000 vertices.

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

↑