.png){kind=icon}
返回
MIP formulations for induced graph optimization problems: a tutorial
.png){kind=icon}
PRE
AI
DOI：10.1111/itor.13299.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a graph G = (V, E) and a subset of its vertices V ' subset of V, the subgraph induced by V ' in G is that with vertex set V ' and edge set E ' formed by all the edges in E linking two vertices in V '. Mixed integer programming (MIP) approaches are among the most successful techniques for solving induced graph optimization problems, that is, those related to obtaining maximum or minimum (weighted or not) induced subgraphs with certain properties. In this tutorial, we provide a literature review of some of these problems. Furthermore, we illustrate the use of MIP formulations and techniques for solving combinatorial optimization problems involving induced graphs. We focus on compact formulations and those with an exponential number of constraints that can be effectively solved using branch-and-cut procedures. More specifically, we revisit applications of their use for problems of finding induced forests (which correspond to the complement of feedback vertex sets), trees, paths, as well as quasi-clique partitionings.
Keyword:
combinatorial optimization
integer programming
induced graphs
feedback vertex set
induced paths
quasi-cliques
networks
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
Effects of Dietary Protein Level and Phase Feeding Regimen on Growth Performance, Carcass Characteristics and Pork Quality in Growing-finishing Pigs日粮蛋白质水平及分阶段饲喂制度对生长育肥猪生长性能、胴体性状及猪肉品质的影响
OAAI
OAAI分享收藏Effects of tropospheric aerosols on radiative flux calculations at UV and visible wavelengths平流层气溶胶对紫外和可见光波段辐射通量计算的影响.png)
OAAI
IF0
OAAI分享收藏分享收藏分享收藏
分享收藏
查看更多内容