Subscribe

Issue No.12 - Dec. (2012 vol.61)

pp: 1813-1822

Yue-Li Wang , National Taiwan University of Science and Technology, Taipei

Cheng-Ju Hsu , Ching Yun University, Taipei

Jia-Jie Liu , Shih Hsin University, Taipei

Ming-Tat Ko , Academia Sinica, Taiwan

Fu-Hsing Wang , Chinese Culture University, Taipei

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2011.204

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 [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.

INDEX TERMS

Energy efficiency, Integer linear programming, Energy management, Optimization, Electronic mail, Dynamic programming, Linear programming, Graphical models, trees, Constrained optimization, dynamic programming, graph algorithms, integer linear programming, secure sets

CITATION

Yue-Li Wang, Cheng-Ju Hsu, Jia-Jie Liu, Ming-Tat Ko, Fu-Hsing Wang, "A New Subclass of Integer Linear Programming Problems and Its Applications",

*IEEE Transactions on Computers*, vol.61, no. 12, pp. 1813-1822, Dec. 2012, doi:10.1109/TC.2011.204REFERENCES