A New Subclass of Integer Linear Programming Problems and Its Applications

文化大學機構典藏 CCUR > 商學院 > 資訊管理學系暨資訊管理研究所 > 期刊論文 > Item 987654321/24155

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/24155

题名:	A New Subclass of Integer Linear Programming Problems and Its Applications
作者:	Wang, YL (Wang, Yue-Li) Hsu, CJ (Hsu, Cheng-Ju) Liu, JJ (Liu, Jia-Jie) Ko, MT (Ko, Ming-Tat) Wang, FH (Wang, Fu-Hsing)
贡献者:	Dept Informat Management
关键词:	Constrained optimization dynamic programming graph algorithms integer linear programming secure sets trees
日期:	2012-12
上传时间:	2013-02-18 14:50:02 (UTC+8)
摘要:	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.
關聯:	IEEE TRANSACTIONS ON COMPUTERS 卷: 61 期: 12 頁數: 1813-1822
显示于类别:	[資訊管理學系暨資訊管理研究所 ] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	444	检视/开启

检视Licence

在CCUR中所有的数据项都受到原著作权保护.