The Community for Technology Leaders
RSS Icon
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
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.204
REFERENCES
[1] Advances in Linear and Integer Programming, J.E. Beasley, ed. Oxford Science, 1996.
[2] M. Bellmore and G.L. Nemhauser, "The Traveling Salesman Problem: A Survey," Operations Research, vol. 16, pp. 538-558, 1968.
[3] M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, and R.E. Tarjan, "Time Bounds for Selection," J. Computer and System Sciences, vol. 7, pp. 448-46, 1973.
[4] R.C. Brigham, R.D. Dutton, and S.T. Hedetniemi, "A Sharp Lower Bound on the Powerful Alliance Number of $C_m \times C_n$ ," Congressus Numerantium, vol. 167, pp. 57-63, 2004.
[5] R.C. Brigham, R.D. Dutton, and S.T. Hedetniemi, "Security in Graphs," Discrete Applied Math., vol. 155, pp. 1708-1714, 2007.
[6] L. Cooper and C.B. Drebes, "An Approximate Solution Method for the Fixed Charge Problem," Naval Research Logistics Quarterly, vol. 16, pp. 101-113, 1967.
[7] R.D. Dutton, R. Lee, and R.C. Brigham, "Bounds on a Graph's Security Number," Discrete Applied Math., vol. 156, pp. 695-704, 2008.
[8] R.I. Enciso and R.D. Dutton, "Lower Bounds for Global Alliances on Planar Graphs," Congressus Numerantium, vol. 187, pp. 187-192, 2007.
[9] O. Favaron, G. Fricke, W. Goddard, S.M. Hedetniemi, S.T. Hedetniemi, P. Kristiansen, R.C. Laskar, and D.R. Skaggs, "Offensive Alliances in Graphs," Discussiones Math. Graph Theory, vol. 24, pp. 263-275, 2004.
[10] L.R. Ford and D.R. Fulkerson, Flows in Networks. Princeton Univ. Press, 1962.
[11] G.H. Fricke, L.M. Lawson, T.W. Haynes, S.M. Hedetniemi, and S.T. Hedetniemi, "A Note on Defensive Alliances in Graphs," Bull. Inst. of Combinatorics and Its Applications, vol. 38, pp. 37-41, 2003.
[12] T.W. Haynes, S.T. Hedetniemi, and M.A. Henning, "Global Defensive Alliances in Graphs," The Electronic J. Combinatorics, vol. 10, no. #R47, 2003.
[13] F.L. Hitchcock, "The Distribution of a Product from Several Sources to Numerous Localities," J. Math. Physics, vol. 20, pp. 224-230, 1941.
[14] T.C. Hu, Integer Programming and Network Flows. Addison-Wesley, 1969.
[15] D.S. Johnson and L.A. McGeoch, "The Traveling Salesman Problem: A Case Study in Local Optimization," Local Search in Combinatorial Optimization, E.H.L. Aarts and J.K. Lenstra, ed., pp. 215-310, John Wiley and Sons, 1997.
[16] P. Kristiansen, S.M. Hedetniemi, and S.T. Hedetniemi, "Alliances in Graphs," J. Combinatorial Math. and Combinatorial Computing, vol. 48, pp. 157-177, 2004.
[17] H.W. Kuhn, "The Hungarian Method for the Assignment Problem," Naval Research Logistics Quarterly, vol. 2, pp. 83-97, 1955.
[18] H.W. Kuhn, "Variants of the Hungarian Method for the Assignment Problem," Naval Research Logistics Quarterly, vol. 3, pp. 253-258, 1956.
[19] J.D.C. Little, G. Murty, D.W. Sweeney, and C. Karel, "An Algorithm for the Traveling Salesman Problem," Operations Research, vol. 11, pp. 972-989, 1963.
[20] A.S. Manne, "On the Job-Shop Scheduling Problem," Operations Research, vol. 8, pp. 219-223, 1960.
[21] C.H. Papadimitriou and S. Vempala, "On the Approximability of the Traveling Salesman Problem," Combinatorica, vol. 26, pp. 101-120, 2006.
[22] J.A. Rodríguez-Velázquez and J.M. Sigarreta, "Offensive Alliances of Cubic Graphs," Int'l Math. Forum, vol. 1, pp. 1773-1782, 2006.
[23] J.A. Rodríguez-Velázquez and J.M. Sigarreta, "Global Offensive Alliances in Graphs," Electronic Notes in Discrete Math., vol. 25, pp. 157-164, 2006.
[24] J.A. Rodríguez-Velázquez and J.M. Sigarreta, "Spectral Study of Alliances in Graphs," Discussiones Math. Graph Theory, vol. 27, pp. 143-157, 2007.
[25] A. Schrijver, Theory of Linear and Integer Programming. John Wiley and Sons, 1998.
[26] J.M. Sigarreta and J.A. Rodríguez-Velázquez, "On Defensive Alliances and Line Graphs," Applied Math. Letters, vol. 19, pp. 1345-1350, 2006.
[27] D.I. Steinberg, "The Fixed Charge Problem," Naval Research Logistics Quarterly, vol. 17, pp. 217-235, 1970.
[28] D.D. Wright, "Solving the Fixed Charge Problem with Lagrangian Relaxation and Cost Allocation Heuristics," European J. Operational Research, vol. 42, pp. 305-312, 1989.
290 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool