A New Subclass of Integer Linear Programming Problems and Its Applications

Yue-Li Wang,Cheng-Ju Hsu,Jia-Jie Liu,Ming-Tat Ko,Fu-Hsing Wang

IEEE Transactions on Computers（2012）

引用 4|浏览0

暂无评分

摘要

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 [CHECK END OF SENTENCE], on trees. A P-constrained secure set problem is to find a minimum secure set containing a set of \vert P\vert predetermined vertices.

查看译文

关键词

integer linear programming problems,minimum secure set,secure set problem,new subclass,integer linear programming problem,check end,p-constrained secure set problem,vert p,efficient algorithm,composition problem,integer programming,linear programming,constrained optimization,energy management,set theory,energy efficiency,integer linear programming,graphical models,dynamic programming,optimization

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要