.png){kind=icon}
返回
A tutorial on branch and cut algorithms for the maximum stable set problem
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1475-3995.2011.00805.x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This tutorial provides an overview of various characteristics of effective branch and cut type algorithms for the maximum stable set problem. We discuss several facet-defining inequalities for the stable set polytope along with their separation routines. In particular, we review implementation tweaks for the separation routines and reference empirical studies, illustrating the performance of these cutting planes for benchmark graphs. In addition to the polyhedral study, we present basic preprocessing, discuss heuristic methods particularly suited within a branch and cut framework, and examine a branching rule.
Keyword:
branch and cut
clique
cutting plane
separation
stable set
stable set polytope
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
分享收藏Dwarf hybrids of the bioenergy crop Ricinus communis suitable for mechanized harvesting reveal differences in morpho-physiological characteristics and seed metabolic profiles适合机械化收获的生物能源作物 Ricinus communis 矮化杂交种的形态生理特性及种子代谢谱存在差异.png)
Euphytica
EuphyticaIF0
PREAI
分享收藏Properties and Radar Cross-Section of forest fire ash particles at millimeter wave森林火灾灰烬颗粒在毫米波下的特性与雷达散射截面
PREAI
分享收藏
查看更多内容