期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 312, 期 1, 页码 117-124出版社
ELSEVIER
DOI: 10.1016/j.ejor.2023.06.015
关键词
Combinatorial optimization; Max-cut; Connectivity; Branch-and-cut; Integer programming
The Connected Max-k-Cut Problem is an extension of the well-known Max-Cut Problem, where the objective is to partition a graph into k connected subgraphs by maximizing the cost of inter-partition edges. The researchers propose a new integer linear program and a branch-and-cut algorithm for this problem, and also use graph isomorphism to structure the instances and facilitate their resolution. Extensive computational experiments show that, if k > 2, their approach outperforms existing algorithms in terms of quality.
The Connected Max-k-Cut Problem is an extension of the well-known Max-Cut Problem. The objective is to partition a graph into k connected subgraphs by maximizing the cost of inter-partition edges. We propose a new integer linear program for the problem and a branch-and-cut algorithm. We also explore graph isomorphism to structure the instances and facilitate their resolution. We conduct extensive computational experiments on both randomly generated instances and instances from the literature where we compare the quality of our method against existing algorithms. The experimental results show that, if k > 2, our approach strictly outperforms those from the literature. (c) 2023ElsevierB.V. Allrightsreserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据