{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:28:36Z","timestamp":1750213716630},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2017,4,19]],"date-time":"2017-04-19T00:00:00Z","timestamp":1492560000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10732-017-9331-3","type":"journal-article","created":{"date-parts":[[2017,4,19]],"date-time":"2017-04-19T08:28:36Z","timestamp":1492590516000},"page":"111-136","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A heuristic approach for dividing graphs into bi-connected components with a size constraint"],"prefix":"10.1007","volume":"23","author":[{"given":"Raka","family":"Jovanovic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatsushi","family":"Nishi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,19]]},"reference":[{"issue":"3","key":"9331_CR1","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1109\/TSG.2012.2198246","volume":"3","author":"SA Arefifar","year":"2012","unstructured":"Arefifar, S.A., Mohamed, Y.A.R.I., EL-Fouly, T.H.: Supply-adequacy-based optimal construction of microgrids in smart distribution systems. IEEE Trans. Smart Grid 3(3), 1491\u20131502 (2012)","journal-title":"IEEE Trans. Smart Grid"},{"issue":"4","key":"9331_CR2","doi-asserted-by":"publisher","first-page":"4192","DOI":"10.1109\/TPWRS.2013.2259852","volume":"28","author":"SA Arefifar","year":"2013","unstructured":"Arefifar, S.A., Mohamed, Y., EL-Fouly, T.H.: Comprehensive operational planning framework for self-healing control actions in smart distribution grids. IEEE Trans. Power Syst. 28(4), 4192\u20134200 (2013)","journal-title":"IEEE Trans. Power Syst."},{"key":"9331_CR3","doi-asserted-by":"publisher","unstructured":"Banerjee, S., Khuller, S.: A clustering scheme for hierarchical control in multi-hop wireless networks. In: INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings, vol. 2, pp. 1028\u20131037. IEEE (2001)","DOI":"10.1109\/INFCOM.2001.916296"},{"issue":"2","key":"9331_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.ejor.2009.10.019","volume":"206","author":"C Bazgan","year":"2010","unstructured":"Bazgan, C., Tuza, Z., Vanderpooten, D.: Satisfactory graph partition, variants, and generalizations. Eur. J. Oper. Res. 206(2), 271\u2013280 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9331_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.automatica.2014.11.017","volume":"52","author":"D Borra","year":"2015","unstructured":"Borra, D., Pasqualetti, F., Bullo, F.: Continuous graph partitioning for camera network surveillance. Automatica 52, 227\u2013231 (2015)","journal-title":"Automatica"},{"issue":"1","key":"9331_CR6","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1287\/ijoc.2014.0619","volume":"27","author":"A Buchanan","year":"2015","unstructured":"Buchanan, A., Sung, J.S., Butenko, S., Pasiliao, E.L.: An integer programming approach for fault-tolerant connected dominating sets. INFORMS J. Comput. 27(1), 178\u2013188 (2015)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"9331_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TCE.2006.1605028","volume":"52","author":"YC Chang","year":"2006","unstructured":"Chang, Y.C., Lin, Z.S., Chen, J.L.: Cluster based self-organization management protocols for wireless sensor networks. IEEE Trans. Consum. Electron. 52(1), 75\u201380 (2006)","journal-title":"IEEE Trans. Consum. Electron."},{"issue":"2","key":"9331_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theor. Comput. Sci. 344(2), 243\u2013278 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9331_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T Feo","year":"1995","unstructured":"Feo, T., Resende, M.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6(2), 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"key":"9331_CR10","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.endm.2013.05.120","volume":"41","author":"VL Forte do","year":"2013","unstructured":"do Forte, V.L., Lucena, A., Maculan, N.: Formulations for the minimum 2-connected dominating set problem. Electron. Notes Discrete Math. 41, 415\u2013422 (2013)","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"9331_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0377-2217(95)00202-2","volume":"94","author":"O Goldschmidt","year":"1996","unstructured":"Goldschmidt, O., Takvorian, A., Yu, G.: On finding a biconnected spanning planar subgraph with applications to the facilities layout problem. Eur. J. Oper. Res. 94(1), 97\u2013105 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9331_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"9331_CR13","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/MPAE.2007.376583","volume":"5","author":"N Hatziargyriou","year":"2007","unstructured":"Hatziargyriou, N., Asano, H., Iravani, R., Marnay, C.: Microgrids. IEEE Power Energy Mag. 5(4), 78\u201394 (2007)","journal-title":"IEEE Power Energy Mag."},{"issue":"2","key":"9331_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0166-218X(93)90046-Q","volume":"42","author":"DS Hochbaum","year":"1993","unstructured":"Hochbaum, D.S.: Why should biconnected components be identified first. Discrete Appl. Math. 42(2), 203\u2013210 (1993)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"9331_CR15","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372\u2013378 (1973a)","journal-title":"Commun. ACM"},{"issue":"3","key":"9331_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2(3), 135\u2013158 (1973b)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9331_CR17","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1002\/net.20370","volume":"55","author":"B Hu","year":"2010","unstructured":"Hu, B., Leitner, M., Raidl, G.R.: The generalized minimum edge-biconnected network problem: efficient neighborhood structures for variable neighborhood search. Networks 55(3), 256\u2013275 (2010)","journal-title":"Networks"},{"issue":"4","key":"9331_CR18","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.jda.2008.03.002","volume":"6","author":"T Ito","year":"2008","unstructured":"Ito, T., Demaine, E.D., Zhou, X., Nishizeki, T.: Approximability of partitioning graphs with supply and demand. J. Discrete Algorithms 6(4), 627\u2013650 (2008)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"9331_CR19","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/s00453-011-9573-7","volume":"64","author":"T Ito","year":"2012","unstructured":"Ito, T., Hara, T., Zhou, X., Nishizeki, T.: Minimum cost partitions of trees with supply and demand. Algorithmica 64(3), 400\u2013415 (2012)","journal-title":"Algorithmica"},{"key":"9331_CR20","unstructured":"Jovanovic, R.: Benchmark data sets for the problem of the maximal bi-connected partitioning of a graph with a size constraint. http:\/\/mail.ipb.ac.rs\/~rakaj\/home\/mbcpg_sc.htm (2017)"},{"key":"9331_CR21","doi-asserted-by":"publisher","unstructured":"Jovanovic, R., Tuba, M.: Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem. Comput. Sci. Inf. Syst. 10(1), 133\u2013149 (2013)","DOI":"10.2298\/CSIS110927038J"},{"issue":"8","key":"9331_CR22","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1007\/s11590-015-0972-6","volume":"10","author":"R Jovanovic","year":"2016","unstructured":"Jovanovic, R., Vo\u00df, S.: A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs. Opt. Lett. 10(8), 1693\u20131703 (2016)","journal-title":"Opt. Lett."},{"issue":"1","key":"9331_CR23","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10479-015-1930-5","volume":"235","author":"R Jovanovic","year":"2015","unstructured":"Jovanovic, R., Bousselham, A., Voss, S.: A heuristic method for solving the problem of partitioning graphs with supply and demand. Ann. Oper. Res. 235(1), 371\u2013393 (2015a)","journal-title":"Ann. Oper. Res."},{"key":"9331_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-015-9945-z","author":"R Jovanovic","year":"2015","unstructured":"Jovanovic, R., Bousselham, A., Voss, S.: Partitioning of supply\/demand graphs with capacity limitations: an ant colony approach. J. Comb. Optim. (2015b). doi: 10.1007\/s10878-015-9945-z","journal-title":"J. Comb. Optim."},{"issue":"1","key":"9331_CR25","doi-asserted-by":"publisher","first-page":"16","DOI":"10.3390\/app6010016","volume":"6","author":"R Jovanovic","year":"2016","unstructured":"Jovanovic, R., Bousselham, A., Bayram, I.S.: Residential demand response scheduling with consideration of consumer preferences. Appl. Sci. 6(1), 16 (2016a)","journal-title":"Appl. Sci."},{"key":"9331_CR26","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.asoc.2016.01.013","volume":"41","author":"R Jovanovic","year":"2016","unstructured":"Jovanovic, R., Tuba, M., Voss, S.: An ant colony optimization algorithm for partitioning graphs with supply and demand. Appl. Soft Comput. 41, 317\u2013330 (2016b)","journal-title":"Appl. Soft Comput."},{"key":"9331_CR27","doi-asserted-by":"publisher","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad-hoc networks beyond unit disk graphs. In: Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing, pp. 69\u201378. ACM (2003)","DOI":"10.1145\/941079.941089"},{"issue":"22","key":"9331_CR28","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1016\/j.ipl.2010.08.008","volume":"110","author":"X Li","year":"2010","unstructured":"Li, X., Zhang, Z.: Two algorithms for minimum 2-connected r-hop dominating set. Inf. Process. Lett. 110(22), 986\u2013991 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9331_CR29","first-page":"121","volume":"15","author":"D Matic","year":"2012","unstructured":"Matic, D., Bozic, M.: Maximally balanced connected partition problem in graphs: application in education. Teach. Math. 15(2), 121\u2013132 (2012)","journal-title":"Teach. Math."},{"issue":"12","key":"9331_CR30","doi-asserted-by":"publisher","first-page":"3188","DOI":"10.1016\/j.cor.2012.09.004","volume":"40","author":"RE Moraes","year":"2013","unstructured":"Moraes, R.E., Ribeiro, C.C.: Power optimization in ad hoc wireless network topology control with biconnectivity requirements. Comput. Oper. Res. 40(12), 3188\u20133196 (2013)","journal-title":"Comput. Oper. Res."},{"key":"9331_CR31","unstructured":"Morgan, M., Grout, V.: Finding optimal solutions to backbone minimisation problems using mixed integer programming. In: Seventh International Network Conference (INC 2008), Plymouth, UK, 8\u201310 July 2008, pp 53\u201363. Proceedings (2008)"},{"key":"9331_CR32","doi-asserted-by":"publisher","unstructured":"Morishita, S., Nishizeki, T.: Parametric power supply networks. In: Du, D.Z., Zhang, G. (eds.) Computing and Combinatorics. Lecture Notes in Computer Science, vol. 7936, pp. 245\u2013256. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-38768-5_23"},{"issue":"2","key":"9331_CR33","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/TPWRD.2013.2239665","volume":"28","author":"HK Nunna","year":"2013","unstructured":"Nunna, H.K., Doolla, S.: Energy management in microgrids using demand response and distributed storagea multiagent approach. IEEE Trans. Power Deliv. 28(2), 939\u2013947 (2013)","journal-title":"IEEE Trans. Power Deliv."},{"issue":"1","key":"9331_CR34","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ipl.2015.08.010","volume":"116","author":"DJ Pearce","year":"2016","unstructured":"Pearce, D.J.: A space-efficient algorithm for finding strongly connected components. Inf. Process. Lett. 116(1), 47\u201352 (2016)","journal-title":"Inf. Process. Lett."},{"key":"9331_CR35","doi-asserted-by":"publisher","unstructured":"Popa, A.: Modelling the power supply network\u2013hardness and approximation. In: Chan, T.H., Lau, L., Trevisan, L. (eds.) Theory and Applications of Models of Computation. Lecture Notes in Computer Science, vol. 7876, pp. 62\u201371. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-38236-9_7"},{"issue":"5","key":"9331_CR36","doi-asserted-by":"publisher","first-page":"281","DOI":"10.2307\/2303897","volume":"46","author":"HE Robbins","year":"1939","unstructured":"Robbins, H.E.: A theorem on graphs, with an application to a problem of traffic control. Am. Math. Mon. 46(5), 281\u2013283 (1939)","journal-title":"Am. Math. Mon."},{"issue":"7","key":"9331_CR37","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ipl.2013.01.016","volume":"113","author":"JM Schmidt","year":"2013","unstructured":"Schmidt, J.M.: A simple test on 2-vertex-and 2-edge-connectivity. Inf. Process. Lett. 113(7), 241\u2013244 (2013)","journal-title":"Inf. Process. Lett."},{"key":"9331_CR38","unstructured":"Shafique, KH.: Partitioning a graph in alliances and its application to data clustering. Ph.D. thesis, University of Central Florida Orlando, Florida (2004)"},{"issue":"2","key":"9331_CR39","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9331_CR40","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/TWC.2009.051053","volume":"8","author":"F Wang","year":"2009","unstructured":"Wang, F., Thai, M.T., Du, D.Z.: On the construction of 2-connected virtual backbone in wireless networks. IEEE Trans. Wirel. Commun. 8(3), 1230\u20131237 (2009)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"810","key":"9331_CR41","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1016\/j.tcs.2008.11.005","volume":"410","author":"Z Zhang","year":"2009","unstructured":"Zhang, Z., Gao, X., Wu, W.: Algorithms for connected set cover problem and fault-tolerant connected set cover problem. Theor. Comput. Sci. 410(810), 812\u2013817 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9331_CR42","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/TPWRS.2010.2051168","volume":"26","author":"RD Zimmerman","year":"2011","unstructured":"Zimmerman, R.D., Murillo-S\u00e1nchez, C.E., Thomas, R.J.: Matpower: steady-state operations, planning, and analysis tools for power systems research and education. IEEE Trans. Power Syst. 26(1), 12\u201319 (2011)","journal-title":"IEEE Trans. Power Syst."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-017-9331-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9331-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9331-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,5]],"date-time":"2020-10-05T20:26:48Z","timestamp":1601929608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-017-9331-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,19]]},"references-count":42,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["9331"],"URL":"https:\/\/doi.org\/10.1007\/s10732-017-9331-3","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,19]]}}}