顶点分离问题的多层双线性规划算法
A Multilevel Bilinear Programming Algorithm For the Vertex Separator Problem
摘要:
图的顶点分离问题是寻找一个最小的顶点集合,去除这些顶点将图分成两个满足指定大小约束的不连通子集。在论文10.1016/j.ejor.2014.05.042中,将顶点分离器问题表述为连续(非凹/非凸)双线性二次规划。在本文中,我们开发了一个更一般的连续双线性程序,其中包括顶点权重,并适用于粗糙的图形中产生的原始顶点分离问题的多级压缩。爬山算法被用来找到一个稳定点的连续双线性二次规划,而二阶最优性条件和扰动技术被用来逃离一个稳定点或局部最大值。求解连续双线性规划的算法被应用于多层格式的求解和精化阶段。计算结果和比较表明了该算法的优越性。
英文摘要:
The Vertex Separator Problem for a graph is to find the smallest collection of vertices whose removal breaks the graph into two disconnected subsets that satisfy specified size constraints. In the paper 10.1016/j.ejor.2014.05.042, the Vertex Separator Problem was formulated as a continuous (non-concave/non-convex) bilinear quadratic program. In this paper, we develop a more general continuous bilinear program which incorporates vertex weights, and which applies to the coarse graphs that are generated in a multilevel compression of the original Vertex Separator Problem. A Mountain Climbing Algorithm is used to find a stationary point of the continuous bilinear quadratic program, while second-order optimality conditions and perturbation techniques are used to escape from either a stationary point or a local maximizer. The algorithms for solving the continuous bilinear program are employed during the solution and refinement phases in a multilevel scheme. Computational results and comparisons demonstrate the advantage of the proposed algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。