A New Subclass of Integer Linear Programming Problems and Its Applications

CCUR > College of Business > Department of Information Management & Graduate Institute of Information Management > periodical articles > Item 987654321/24155

Please use this identifier to cite or link to this item: https://irlib.pccu.edu.tw/handle/987654321/24155

Title:	A New Subclass of Integer Linear Programming Problems and Its Applications
Authors:	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)
Contributors:	Dept Informat Management
Keywords:	Constrained optimization dynamic programming graph algorithms integer linear programming secure sets trees
Date:	2012-12
Issue Date:	2013-02-18 14:50:02 (UTC+8)
Abstract:	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.
Relation:	IEEE TRANSACTIONS ON COMPUTERS 卷: 61 期: 12 頁數: 1813-1822
Appears in Collections:	[Department of Information Management & Graduate Institute of Information Management] periodical articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	444	View/Open

View Licence