{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T16:56:32Z","timestamp":1761929792680},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2015,11,4]],"date-time":"2015-11-04T00:00:00Z","timestamp":1446595200000},"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":["Optim Lett"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s11590-015-0972-6","type":"journal-article","created":{"date-parts":[[2015,11,4]],"date-time":"2015-11-04T09:11:57Z","timestamp":1446628317000},"page":"1693-1703","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs"],"prefix":"10.1007","volume":"10","author":[{"given":"Raka","family":"Jovanovic","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,4]]},"reference":[{"key":"972_CR1","unstructured":"Narayanaswamy, N.S., Ramakrishna, G.: Linear time algorithm for tree t-spanner in outerplanar graphs via supply-demand partition in trees. In: CoRR. abs\/1210.7919 (2012)"},{"issue":"4","key":"972_CR2","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.: Partitioning trees of supply and demand. Int. J. Found. Comput. Sci. 16(4), 803\u2013827 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"6","key":"972_CR3","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.: Partitioning trees with supply, demand and edge-capacity. IEICE Trans. 96\u2013A(6), 1036\u20131043 (2013)","journal-title":"IEICE Trans."},{"issue":"4","key":"972_CR4","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.: Approximability of partitioning graphs with supply and demand. J. Discret. Algorithms 6(4), 627\u2013650 (2008)","journal-title":"J. Discret. Algorithms"},{"key":"972_CR5","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1007\/3-540-36136-7_53","volume":"2518","author":"T Ito","year":"2002","unstructured":"Ito, T., Zhou, X., Nishizeki, T.: Partitioning trees of supply and demand. Lect. Notes. Comput. Sci. 2518, 612\u2013623 (2002)","journal-title":"Lect. Notes. Comput. Sci."},{"key":"972_CR6","unstructured":"Jovanovic, R., Tuba, M., Vo\u00df, S.: An ant colony optimization algorithm for partitioning graphs with supply and demand. Techn. Rep. (2014)"},{"key":"972_CR7","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/978-3-642-38236-9_7","volume":"7876","author":"A Popa","year":"2013","unstructured":"Popa, A.: Modelling the power supply network\u2014hardness and approximation. Lect. Notes. Comput. Sci. 7876, 62\u201371 (2013)","journal-title":"Lect. Notes. Comput. Sci."},{"key":"972_CR8","doi-asserted-by":"publisher","unstructured":"Jovanovic, R., Bousselham, A., Vo\u00df, S.: A heuristic method for solving the problem of partitioning graphs with supply and demand. Ann. Oper. Res. (2015). doi: 10.1007\/s10479-015-1930-5","DOI":"10.1007\/s10479-015-1930-5"},{"key":"972_CR9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-642-38768-5_23","volume":"7936","author":"S Morishita","year":"2013","unstructured":"Morishita, S., Nishizeki, T.: Parametric power supply networks. Lect. Notes. Comput. Sci. 7936, 245\u2013256 (2013)","journal-title":"Lect. Notes. Comput. Sci."},{"issue":"1","key":"972_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10878-013-9661-5","volume":"29","author":"S Morishita","year":"2015","unstructured":"Morishita, S., Nishizeki, T.: Parametric power supply networks. J. Comb. Optim. 29(1), 1\u201315 (2015)","journal-title":"J. Comb. Optim."},{"key":"972_CR11","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/978-3-319-19647-3_17","volume":"9130","author":"M Lin","year":"2015","unstructured":"Lin, M., Li, W., Feng, Q.: Parameterized minimum cost partition of a tree with supply and demand. Lect. Notes. Comput. Sci. 9130, 180 (2015)","journal-title":"Lect. Notes. Comput. Sci."},{"key":"972_CR12","doi-asserted-by":"publisher","unstructured":"Jovanovic, R., Bousselham, A., Vo\u00df, S.: Partitioning of supply\/demand graphs with capacity limitations: an ant colony approach. J. Comb. Optim. (2015). doi: 10.1007\/s10878-015-9945-z","DOI":"10.1007\/s10878-015-9945-z"},{"key":"972_CR13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/978-3-319-08016-1_11","volume":"9130","author":"K Inoue","year":"2014","unstructured":"Inoue, K., Nishizeki, T.: Spanning distribution forests of graphs. Lect. Notes. Comput. Sci. 9130, 117\u2013127 (2014)","journal-title":"Lect. Notes. Comput. Sci."},{"issue":"3","key":"972_CR14","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1587\/transinf.E97.D.406","volume":"97","author":"M Kawabata","year":"2014","unstructured":"Kawabata, M., Nishizeki, T.: Spanning distribution trees of graphs. IEICE Trans. Inf. Syst. 97(3), 406\u2013412 (2014)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"972_CR15","unstructured":"Morgan, M., Grout, V.: Finding optimal solutions to backbone minimisation problems using mixed integer programming. In: Proceedings of the 7th International Network Conference (INC 2008). pp 53\u201364 (2008)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0972-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0972-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0972-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0972-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:43Z","timestamp":1559394703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0972-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,4]]},"references-count":15,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["972"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0972-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2015,11,4]]}}}