.png){kind=icon}
返回
A New Subclass of Integer Linear Programming Problems and Its Applications
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2011.204.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we define a new subclass of integer linear programming problems called the composition problem. We shall propose efficient algorithms for solving this problem and its variants. Moreover, as an application of the composition problem, those algorithms are applied to solve the P-constrained secure set problem, which is a variation of the secure set problem introduced in [5], on trees. A P-constrained secure set problem is to find a minimum secure set containing a set of vertical bar P vertical bar predetermined vertices.
Keyword:
Constrained optimization
dynamic programming
graph algorithms
integer linear programming
secure sets
trees
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
引用论文
Replacing Soybean Meal with Urea in Diets for Heavy Fattening Lambs: Effects on Growth, Metabolic Profile and Meat Quality.png)
Animals
OAAI
AnimalsIF0
OAAI分享收藏Hydrothermal preparation and low temperature magnetic properties of TbOOH, DyOOH, HoOOH, ErOOH, and YbOOHTbOOH，DyOOH，HoOOH，ErOOH和YbOOH的水热制备和低温磁性
PREAI
分享收藏
查看更多内容