最大稳定集问题的拉格朗日松弛法
A Lagrangian Relaxation for the Maximum Stable Set Problem
摘要:
我们提出了一个新的整数规划制定的问题,找到一个最大的稳定集的基础上的稳定集的代表图。此外,我们调查的拉格朗日分解,其中只有一个约束放松这个提法提供的精确解。我们的算法在多核系统中进行了有效的多线程实现的一些计算实验,并给出了结果。
英文摘要:
We propose a new integer programming formulation for the problem of finding a maximum stable set of a graph based on representatives of stable sets. In addition, we investigate exact solutions provided by a Lagrangian decomposition of this formulation in which only one constraint is relaxed. Some computational experiments were carried out with an effective multi-threaded implementation of our algorithm in a multi-core system, and their results are presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。