.png){kind=icon}
返回
Mixed-integer programming techniques for the connected max-k-cut problem
.png){kind=icon}
OA
AI
DOI：10.1007/s12532-020-00186-3.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider an extended version of the classical Max-k-Cut problem in which we additionally require that the parts of the graph partition are connected. For this problem we study two alternative mixed-integer linear formulations and review existing as well as develop new branch-and-cut techniques like cuts, branching rules, propagation, primal heuristics, and symmetry breaking. The main focus of this paper is an extensive numerical study in which we analyze the impact of the different techniques for various test sets. It turns out that the techniques from the existing literature are not sufficient to solve an adequate fraction of the test sets. However, our novel techniques significantly outperform the existing ones both in terms of running times and the overall number of instances that can be solved.
Keyword:
Max-cut
Connectivity
Branch-and-cut
Mixed-integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
198
被引数:
1.9K
机构
引用论文
Thermal decomposition of nickel aluminium mixed hydroxides and formation of nickel aluminate spinel
.png){kind=icon}
PREAI
分享收藏
Luminescence of Li6Y(BO3)3 doped with Pr3+ ions under x-ray, electron beam and ultraviolet excitation在X射线、电子束和紫外激发下掺杂Pr3+离子的Li6Y(BO3)3的发光
PREAI
分享收藏The Effect of Pre-irradiation Defects on the Recombination Luminescence in Activated Crystals K2SO4预辐照缺陷对激活晶体K2SO4中复合发光的影响OAAI
OAAI分享收藏
查看更多内容