{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:53:58Z","timestamp":1757454838691},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,8,18]],"date-time":"2015-08-18T00:00:00Z","timestamp":1439856000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10878-015-9945-z","type":"journal-article","created":{"date-parts":[[2015,8,17]],"date-time":"2015-08-17T10:41:26Z","timestamp":1439808086000},"page":"224-249","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Partitioning of supply\/demand graphs with capacity limitations: an ant colony approach"],"prefix":"10.1007","volume":"35","author":[{"given":"Raka","family":"Jovanovic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelkader","family":"Bousselham","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":[[2015,8,18]]},"reference":[{"key":"9945_CR1","doi-asserted-by":"crossref","unstructured":"Andreev K, R\u00e4cke H (2004) Balanced graph partitioning. In: Proceedings of the sixteenth annual ACM symposium on parallelism in algorithms and architectures. SPAA \u201904. ACM, New York, pp 120\u2013124","DOI":"10.1145\/1007912.1007931"},{"issue":"3","key":"9945_CR2","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1109\/TSG.2012.2198246","volume":"3","author":"S Arefifar","year":"2012","unstructured":"Arefifar S, Mohamed Y, EL-Fouly THM (2012) Supply-adequacy-based optimal construction of microgrids in smart distribution systems. IEEE Trans Smart Grid 3(3):1491\u20131502","journal-title":"IEEE Trans Smart Grid"},{"issue":"4","key":"9945_CR3","doi-asserted-by":"crossref","first-page":"4192","DOI":"10.1109\/TPWRS.2013.2259852","volume":"28","author":"S Arefifar","year":"2013","unstructured":"Arefifar S, Mohamed YR, EL-Fouly T (2013a) Comprehensive operational planning framework for self-healing control actions in smart distribution grids. IEEE Trans Power Syst 28(4):4192\u20134200","journal-title":"IEEE Trans Power Syst"},{"issue":"3","key":"9945_CR4","doi-asserted-by":"crossref","first-page":"1567","DOI":"10.1109\/TSG.2013.2259854","volume":"4","author":"S Arefifar","year":"2013","unstructured":"Arefifar S, Mohamed YR, EL-Fouly T (2013b) Optimum microgrid design for enhancing reliability and supply-security. IEEE Trans Smart Grid 4(3):1567\u20131575","journal-title":"IEEE Trans Smart Grid"},{"issue":"3","key":"9945_CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0401030","volume":"1","author":"E Barnes","year":"1988","unstructured":"Barnes E, Vannelli A, Walker J (1988) A new heuristic for partitioning the nodes of a graph. SIAM J Discrete Math 1(3):299\u2013305","journal-title":"SIAM J Discrete Math"},{"key":"9945_CR6","first-page":"279","volume-title":"Applications of evolutionary computing. Lecture notes in computer science","author":"F Comellas","year":"2006","unstructured":"Comellas F, Sapena E (2006) A multiagent algorithm for graph partitioning. In: Rothlauf F, Branke J, Cagnoni S, Costa E, Cotta C, Drechsler R, Lutton E, Machado P, Moore J, Romero J, Smith G, Squillero G, Takagi H (eds) Applications of evolutionary computing. Lecture notes in computer science, vol 3907. Springer, Berlin, pp 279\u2013285"},{"issue":"2","key":"9945_CR7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344(2):243\u2013278","journal-title":"Theor Comput Sci"},{"issue":"1","key":"9945_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9945_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MG (1995) Greedy randomized adaptive search procedures. J Global Optim 6(2):109\u2013133","journal-title":"J Global Optim"},{"key":"9945_CR10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"JP Hart","year":"1987","unstructured":"Hart JP, Shogan AW (1987) Semi-greedy heuristics: an empirical study. Oper Res Lett 6:107\u2013114","journal-title":"Oper Res Lett"},{"issue":"4","key":"9945_CR11","doi-asserted-by":"crossref","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 (2007) Microgrids. IEEE Power Energ Mag 5(4):78\u201394","journal-title":"IEEE Power Energ Mag"},{"key":"9945_CR12","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/978-3-642-20364-0_6","volume-title":"Evolutionary computation in combinatorial optimization. Lecture notes in computer science","author":"M Hinne","year":"2011","unstructured":"Hinne M, Marchiori E (2011) Cutting graphs using competing ant colonies and an edge clustering heuristic. In: Merz P, Hao JK (eds) Evolutionary computation in combinatorial optimization. Lecture notes in computer science, vol 6622. Springer, Berlin, pp 60\u201371"},{"issue":"4","key":"9945_CR13","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1142\/S0129054105003303","volume":"16","author":"T Ito","year":"2005","unstructured":"Ito T, Zhou X, Nishizeki T (2005) Partitioning trees of supply and demand. Int J Found Comput Sci 16(4):803\u2013827","journal-title":"Int J Found Comput Sci"},{"issue":"4","key":"9945_CR14","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/j.jda.2008.03.002","volume":"6","author":"T Ito","year":"2008","unstructured":"Ito T, Demaine ED, Zhou X, Nishizeki T (2008) Approximability of partitioning graphs with supply and demand. J Discrete Algorithms 6(4):627\u2013650","journal-title":"J Discrete Algorithms"},{"issue":"3","key":"9945_CR15","doi-asserted-by":"crossref","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 (2012) Minimum cost partitions of trees with supply and demand. Algorithmica 64(3):400\u2013415","journal-title":"Algorithmica"},{"key":"9945_CR16","doi-asserted-by":"crossref","unstructured":"Jovanovic R (2015) Benchmark data sets for the problem of partitioning graphs with supply and demand. http:\/\/mail.ipb.ac.rs\/~rakaj\/home\/graphsdlc.htm","DOI":"10.1007\/s10479-015-1930-5"},{"key":"9945_CR17","doi-asserted-by":"crossref","unstructured":"Jovanovic R, Bousselham A (2014) A greedy method for optimizing the self-adequacy of microgrids presented as partitioning of graphs with supply and demand. In: The 2nd international renewable and sustainable energy conference Ouarzazate. IEEE conference, pp 154\u2013159, October 17\u201319, 2014","DOI":"10.1109\/IRSEC.2014.7059835"},{"issue":"8","key":"9945_CR18","doi-asserted-by":"crossref","first-page":"5360","DOI":"10.1016\/j.asoc.2011.05.023","volume":"11","author":"R Jovanovic","year":"2011","unstructured":"Jovanovic R, Tuba M (2011) An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Appl Soft Comput 11(8):5360\u20135366","journal-title":"Appl Soft Comput"},{"issue":"3","key":"9945_CR19","doi-asserted-by":"crossref","first-page":"133","DOI":"10.2298\/CSIS110927038J","volume":"10","author":"R Jovanovic","year":"2013","unstructured":"Jovanovic R, Tuba M (2013) Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem. Comput Sci Inf Syst 10(3):133\u2013149","journal-title":"Comput Sci Inf Syst"},{"key":"9945_CR20","unstructured":"Jovanovic R, Tuba M, Vo\u00df S (2014) An ant colony optimization algorithm for partitioning graphs with supply and demand. arXiv:1503.0089"},{"key":"9945_CR21","doi-asserted-by":"publisher","unstructured":"Jovanovic R, Bousselham A, Vo\u00df S (2015) A heuristic method for solving the problem of partitioning graphs with supply and demand. Ann Oper Res. doi: 10.1007\/s10479-015-1930-5","DOI":"10.1007\/s10479-015-1930-5"},{"issue":"6","key":"9945_CR22","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1587\/transfun.E96.A.1036","volume":"96\u2013A","author":"M Kawabata","year":"2013","unstructured":"Kawabata M, Nishizeki T (2013) Partitioning trees with supply, demand and edge-capacity. IEICE Trans 96\u2013A(6):1036\u20131043","journal-title":"IEICE Trans"},{"key":"9945_CR23","first-page":"245","volume-title":"Computing and combinatorics. Lecture notes in computer science","author":"S Morishita","year":"2013","unstructured":"Morishita S, Nishizeki T (2013) Parametric power supply networks. In: Du DZ, Zhang G (eds) Computing and combinatorics. Lecture notes in computer science, vol 7936. Springer, Berlin, pp 245\u2013256"},{"key":"9945_CR24","doi-asserted-by":"crossref","unstructured":"Narayanaswamy NS, Ramakrishna G (2012) Linear time algorithm for tree t-spanner in outerplanar graphs via supply-demand partition in trees arXiv:1210.7919 , accepted in Discrete Applied Mathematics (2014)","DOI":"10.1016\/j.dam.2014.11.001"},{"key":"9945_CR25","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/978-3-642-38236-9_7","volume-title":"Theory and applications of models of computation. Lecture notes in computer science","author":"A Popa","year":"2013","unstructured":"Popa A (2013) Modelling the power supply network - hardness and approximation. In: Chan TH, Lau L, Trevisan L (eds) Theory and applications of models of computation. Lecture notes in computer science, vol 7876. Springer, Berlin, pp 62\u201371"},{"issue":"12","key":"9945_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disopt.2009.07.001","volume":"7","author":"G Reinelt","year":"2010","unstructured":"Reinelt G, Wenger KM (2010) Generating partitions of a graph into a fixed number of minimum weight cuts. Discrete Optim 7(12):1\u201312","journal-title":"Discrete Optim"},{"issue":"3","key":"9945_CR27","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.dam.2007.03.022","volume":"156","author":"G Reinelt","year":"2008","unstructured":"Reinelt G, Theis DO, Wenger KM (2008) Computing finest mincut partitions of a graph and application to routing problems. Discrete Appl Math 156(3):385\u2013396","journal-title":"Discrete Appl Math"},{"issue":"5","key":"9945_CR28","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1504\/IJBIC.2011.042257","volume":"3","author":"K Tashkova","year":"2011","unstructured":"Tashkova K, Korosec P, Silc J (2011) A distributed multilevel ant-colony algorithm for the multi-way graph partitioning. Int J Bio-Inspired Comput 3(5):286\u2013296","journal-title":"Int J Bio-Inspired Comput"},{"issue":"1","key":"9945_CR29","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10479-005-2060-2","volume":"136","author":"S Vo\u00df","year":"2005","unstructured":"Vo\u00df S, Fink A, Duin C (2005) Looking ahead with the pilot method. Ann Oper Res 136(1):285\u2013302","journal-title":"Ann Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9945-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9945-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9945-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9945-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T14:22:53Z","timestamp":1653056573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9945-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,18]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["9945"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9945-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,18]]}}}