참고문헌
- Agarwal, Y., K. Mathur, and H. M. Salkin, "A set-partitioning-based exact algorithm for the vehicle routing problem," Networks 19 (1989), 731-749. https://doi.org/10.1002/net.3230190702
- Berman, P., G. Calinescu, C. Shah, and A. Zelikovsky, "Power efficient monitoring management in sensor networks," Proceedings of IEEE Wireless communication and networking conference, Atlanta, GA, (2004), 2329-2334.
- Bertsimas, D. and J. N. Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, Massachusetts, 1997.
- Calinescu, G., "A fast localized algorithm for scheduling sensors," Journal of Parallel and Distributed Computing 68 (2006), 507-514.
- Cardei, M., M. T. Thai, Y. Li, and W. Wu, "Energy‐efficient target coverage in wireless sensor networks," IEEE INFOCOM 24th Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE Communications Society, Miami, Florida, 3 (2005), 1976-1984.
- Cardei, M. and D. Z. Du, "Wireless Sensor Network Lifetime through Power Aware Organization," Wireless Networks 11, 3 (2005), 333-340. https://doi.org/10.1007/s11276-005-6615-6
- Cheng, M. X., L. Ruan, and W. Wu, "Coverage Breach Problems in Bandwidth-Constrained Sensor Networks," ACM Transactions on Sensor Networks 3, 12 (2007).
- Cheng, M. X. and X. Gong, "Maximum Life Time Coverage Preserving Scheduling Algorithms in Sensor Networks," Journal of Global Optimization, 2010.
- Dantzig, G. B. and P. Wolfe, Decomposition principle for linear programs, Operations Research 8, 1 (1960), 101-111. https://doi.org/10.1287/opre.8.1.101
- Floreen, P. P. Kaski, T. Musto, and J. Suomela, "Local Approximation Algorithms for Scheduling Problems in Sensor Networks," Lecture Notes in Computer Science 4837 (2008), 99-113.
- Ford, L. R. and D. R. Fulkerson, "A suggested computation for maximal multicommodigy network flows," Management Science 5, 1 (1958), 97-101. https://doi.org/10.1287/mnsc.5.1.97
- Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, 1979.
- Gilmore, P. C. and R. E. Gomory, "A linear programing approach to the cutting‐stock problem," Operations Research 9, 6 (1961), 849-859. https://doi.org/10.1287/opre.9.6.849
- Gilmore, P. C. and R. E. Gomory, "A linear programing approach to the cutting‐stock problem-Part II," Operations Research 11, 6 (1963), 863-888. https://doi.org/10.1287/opre.11.6.863
- Hahn, R. and H. Reichl, "Batteries and power supplies for wearable and ubiquitous computing," 3rd International Symposium on Wearable Computers, IEEE Computer Society, San Francisco, California, (July/August 1999), 168-169.
- Lai, C., C. Ting, and R. Ko, An effective genetic algorithm to improve wireless sensor network lifetime for large-scale surveillance applications, IEEE Congress on Evolutionary Computation, Singapore, (2007), 3531-3538.
- Johnson, D. S., M. Yannakakis, and C. H. Papadimitriou, On Generating all Maximal Independent Sets, Information Processing Letters 27 (1988), 119-123. https://doi.org/10.1016/0020-0190(88)90065-8
- Lubbecke, M. E. and J. Desrosiers, "Selected topics in column generation," Operations Research 53, 6 (2005), 1007-1023. https://doi.org/10.1287/opre.1050.0234
- du Merle, O., D. Villeneuve, J. Desrosiers, and P. Hansen, "Stabilized column generation," Discrete Mathematics 194 (1999), 229-237. https://doi.org/10.1016/S0012-365X(98)00213-1
- Marsten, R. E., "The use of the box step method in discrete optimization," Mathematical Programming Study 3 (1975), 127-144.
- Marsten, R. E., W. W. Hogan, and J. W. Blankenship, "The BOXSTEP method for large-scale optimization," Operations Research 23, 3 (1975), 389-405. https://doi.org/10.1287/opre.23.3.389
- Mito, M. and S. Fujita, "Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction," Lecture Notes in Computer Science 5092 (2008), 425-433.
- Moscibroda, T. and R. Wattenhofer, "Maximize the Lifetime of Dominating Sets," IEEE International Parallel and Distributed Processing Symposium, Denver, Colorado, April 2005.
- Pemmaraju, S. V. and I. A. Pirwani, "Energy conservation via domatic partitions," 7th ACM international symposium on Mobile ad hoc networking and computing, ACM SIGMOBILE, Florence, Italy, (2006), 143-154.
- Pigatti, A., M. P. de Aragao, and E. Uchoa, "Stabilized branch and cut and price for the generalized assignment problem," Electronic Notes in Discrete Mathematics 19 (2005), 389-395.
- Slijepcevic, S. and M. Potkonjak, Power efficient organization of wireless sensor networks, IEEE International Conference on Communications, Helsinki, Finland, 2 (2001), 472-476.
- Stine, J. and G. de Veciana, Improving energy efficiency of centrally controlled wireless data networks, Wireless Networks 8, 6 (2002), 681-700. https://doi.org/10.1023/A:1020379326558
- Wang, B., Coverage Lifetime Maximization in Coverage Control in Sensor Networks, Springer, London, 2010.
- Zorbas, D. and C. Douligeris, Satisfying coverage and connectivity in bandwidth constrained sensor networks, 9th International Conference on Communications and information technologies, Incheon, Korea, 2C (2009), 390-395.