连通k-划分问题的精确和启发式解

2020 7th International Conference on Control, Decision and Information Technologies (CoDIT) Pub Date : 2020-06-29 DOI:10.1109/CoDIT49905.2020.9263884

P. Healy, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka

{"title":"连通k-划分问题的精确和启发式解","authors":"P. Healy, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka","doi":"10.1109/CoDIT49905.2020.9263884","DOIUrl":null,"url":null,"abstract":"We study the problem of partitioning a graph into k connected components, which may also be referred to as the maximum k-cutset problem. Firstly, we present an exact algorithm and a variant, both implemented as integer linear programming (ILP) models. We then present a heuristic approach that will be seen to be extremely competitive with the exact algorithm for the ranges of graph under consideration.","PeriodicalId":355781,"journal":{"name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"247 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Exact and Heuristic Solutions to the Connected k-Partitioning Problem\",\"authors\":\"P. Healy, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka\",\"doi\":\"10.1109/CoDIT49905.2020.9263884\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the problem of partitioning a graph into k connected components, which may also be referred to as the maximum k-cutset problem. Firstly, we present an exact algorithm and a variant, both implemented as integer linear programming (ILP) models. We then present a heuristic approach that will be seen to be extremely competitive with the exact algorithm for the ranges of graph under consideration.\",\"PeriodicalId\":355781,\"journal\":{\"name\":\"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)\",\"volume\":\"247 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CoDIT49905.2020.9263884\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CoDIT49905.2020.9263884","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们研究了将一个图划分为k个连通分量的问题，这也可以称为最大k切集问题。首先，我们提出了一种精确算法和一种变型算法，两者都以整数线性规划(ILP)模型实现。然后，我们提出了一种启发式方法，该方法将被视为与所考虑的图范围的精确算法极具竞争力。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Exact and Heuristic Solutions to the Connected k-Partitioning Problem

We study the problem of partitioning a graph into k connected components, which may also be referred to as the maximum k-cutset problem. Firstly, we present an exact algorithm and a variant, both implemented as integer linear programming (ILP) models. We then present a heuristic approach that will be seen to be extremely competitive with the exact algorithm for the ranges of graph under consideration.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)

自引率

0.00%

发文量