{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,29]],"date-time":"2026-10-29T02:53:45Z","timestamp":1793242425023,"version":"4.5.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,7,4]],"date-time":"2015-07-04T00:00:00Z","timestamp":1435968000000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10479-015-1930-5","type":"journal-article","created":{"date-parts":[[2015,7,3]],"date-time":"2015-07-03T16:43:29Z","timestamp":1435941809000},"page":"371-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A heuristic method for solving the problem of partitioning graphs with supply and demand"],"prefix":"10.1007","volume":"235","author":[{"given":"Raka","family":"Jovanovic","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abdelkader","family":"Bousselham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,7,4]]},"reference":[{"issue":"14","key":"1930_CR1","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/0360-8352(91)90165-3","volume":"21","author":"AS Alfa","year":"1991","unstructured":"Alfa, A. S., Heragu, S. S., & Chen, M. (1991). A 3-opt based simulated annealing algorithm for vehicle routing problems. Computers & Industrial Engineering, 21(14), 635\u2013639.","journal-title":"Computers & Industrial Engineering"},{"key":"1930_CR2","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 (pp. 120\u2013124). New York: ACM","DOI":"10.1145\/1007912.1007931"},{"issue":"3","key":"1930_CR3","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, T. H. M. (2012). Supply-adequacy-based optimal construction of microgrids in smart distribution systems. IEEE Transactions on Smart Grid, 3(3), 1491\u20131502.","journal-title":"IEEE Transactions on Smart Grid"},{"issue":"3","key":"1930_CR4","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 Journal on Discrete Mathematics, 1(3), 299\u2013305.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"1930_CR5","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/61.974213","volume":"17","author":"N Boulaxis","year":"2002","unstructured":"Boulaxis, N., & Papadopoulos, M. (2002). Optimal feeder routing in distribution system planning using dynamic programming technique and GIS facilities. IEEE Transactions on Power Delivery, 17(1), 242\u2013247.","journal-title":"IEEE Transactions on Power Delivery"},{"issue":"18","key":"1930_CR6","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1016\/S0140-3664(98)00211-4","volume":"21","author":"P Chaudhuri","year":"1998","unstructured":"Chaudhuri, P. (1998). An optimal distributed algorithm for finding articulation points in a network. Computer Communications, 21(18), 1707\u20131715.","journal-title":"Computer Communications"},{"issue":"6","key":"1930_CR7","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G. A. (1958). A method for solving traveling-salesman problems. Operations Research, 6(6), 791\u2013812.","journal-title":"Operations Research"},{"key":"1930_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10479-011-0983-3","volume":"191","author":"P Galinier","year":"2011","unstructured":"Galinier, P., Boujbel, Z., & Coutinho Fernandes, M. (2011). An efficient memetic algorithm for the graph partitioning problem. Annals of Operations Research, 191, 1\u201322.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"1930_CR9","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. International Journal of Foundations of Computer Science, 16(4), 803\u2013827.","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"4","key":"1930_CR10","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, E. D., Zhou, X., & Nishizeki, T. (2008). Approximability of partitioning graphs with supply and demand. Journal of Discrete Algorithms, 6(4), 627\u2013650.","journal-title":"Journal of Discrete Algorithms"},{"issue":"3","key":"1930_CR11","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":"1930_CR12","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 International renewable and sustainable energy conference (IRSEC), 2014 (pp. 565\u2013570).","DOI":"10.1109\/IRSEC.2014.7059835"},{"issue":"8","key":"1930_CR13","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. Applied Soft Computing, 11(8), 5360\u20135366.","journal-title":"Applied Soft Computing"},{"key":"1930_CR14","doi-asserted-by":"crossref","unstructured":"Jovanovic, R., & Tuba, M. (2013). Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem. Computer Science and Information Systems, 10(1), 133\u2013149.","DOI":"10.2298\/CSIS110927038J"},{"issue":"6","key":"1930_CR15","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 Transactions, 96\u2013A(6), 1036\u20131043.","journal-title":"IEICE Transactions"},{"issue":"2","key":"1930_CR16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B. W., & Lin, S. (1970). An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2), 291\u2013307.","journal-title":"Bell System Technical Journal"},{"issue":"1","key":"1930_CR17","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/B:HEUR.0000019985.94952.eb","volume":"10","author":"YH Kim","year":"2004","unstructured":"Kim, Y. H., & Moon, B. R. (2004). Lock-gain based graph partitioning. Journal of Heuristics, 10(1), 37\u201357.","journal-title":"Journal of Heuristics"},{"key":"1930_CR18","unstructured":"Kukreja, K. (2013). Articulation points or cut vertices in a graph. http:\/\/kartikkukreja.wordpress.com\/2013\/11\/09\/articulation-points-or-cut-vertices-in-a-graph\/ ."},{"issue":"3","key":"1930_CR19","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1009665717611","volume":"4","author":"V Maniezzo","year":"1998","unstructured":"Maniezzo, V., Mingozzi, A., & Baldacci, R. (1998). A bionomic approach to the capacitated p-median problem. Journal of Heuristics, 4(3), 263\u2013280. doi: 10.1023\/A:1009665717611 .","journal-title":"Journal of Heuristics"},{"issue":"3","key":"1930_CR20","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10589-005-4798-5","volume":"32","author":"Y Marinakis","year":"2005","unstructured":"Marinakis, Y., Migdalas, A., & Pardalos, P. (2005). Expanding neighborhood grasp for the traveling salesman problem. Computational Optimization and Applications, 32(3), 231\u2013257.","journal-title":"Computational Optimization and Applications"},{"key":"1930_CR21","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 D. Z. Du & G. Zhang (Eds.), Computing and combinatorics, lecture notes in computer science (Vol. 7936, pp. 245\u2013256). Berlin: Springer."},{"issue":"3","key":"1930_CR22","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1109\/61.871365","volume":"15","author":"AB Morton","year":"2000","unstructured":"Morton, A. B., & Mareels, I. M. (2000). An efficient brute-force solution to the network reconfiguration problem. IEEE Transactions on Power Delivery, 15(3), 996\u20131000.","journal-title":"IEEE Transactions on Power Delivery"},{"key":"1930_CR23","unstructured":"Narayanaswamy, N.S., & Ramakrishna, G. (2012). Linear time algorithm for tree t-spanner in outerplanar graphs via supply\u2013demand partition in trees. In CoRR, abs\/1210.7919 ."},{"key":"1930_CR24","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\u2014hardness and approximation. In T. H. Chan, L. Lau, & L. Trevisan (Eds.), Theory and applications of models of computation, lecture notes in computer science (Vol. 7876, pp. 62\u201371). Berlin: Springer."},{"issue":"12","key":"1930_CR25","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, K. M. (2010). Generating partitions of a graph into a fixed number of minimum weight cuts. Discrete Optimization, 7(12), 1\u201312.","journal-title":"Discrete Optimization"},{"issue":"3","key":"1930_CR26","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, D. O., & Wenger, K. M. (2008). Computing finest mincut partitions of a graph and application to routing problems. Discrete Applied Mathematics, 156(3), 385\u2013396.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"1930_CR27","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.ejor.2004.08.014","volume":"169","author":"S Scheuerer","year":"2006","unstructured":"Scheuerer, S., & Wendolsky, R. (2006). A scatter search heuristic for the capacitated clustering problem. European Journal of Operational Research, 169(2), 533\u2013547.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1930_CR28","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/61.974215","volume":"17","author":"JH Teng","year":"2002","unstructured":"Teng, J. H., & Lu, C. N. (2002). Feeder-switch relocation for customer interruption cost minimization. IEEE Transactions on Power Delivery, 17(1), 254\u2013259.","journal-title":"IEEE Transactions on Power Delivery"},{"issue":"15","key":"1930_CR29","first-page":"13","volume":"5","author":"M Tupia","year":"2013","unstructured":"Tupia, M., Cueva, R., & Guanira, M. (2013). A grasp algorithm with 2-opt improvement for job scheduling enviroment in ceramics production lines. Advances in Information Sciences & Service Sciences, 5(15), 13\u201323.","journal-title":"Advances in Information Sciences & Service Sciences"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1930-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-1930-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1930-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:10:00Z","timestamp":1559153400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-1930-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,4]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["1930"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-1930-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,4]]}}}