{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:23Z","timestamp":1759637903077},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,9,28]],"date-time":"2013-09-28T00:00:00Z","timestamp":1380326400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10878-013-9661-5","type":"journal-article","created":{"date-parts":[[2013,9,27]],"date-time":"2013-09-27T13:12:58Z","timestamp":1380287578000},"page":"1-15","source":"Crossref","is-referenced-by-count":7,"title":["Parametric power supply networks"],"prefix":"10.1007","volume":"29","author":[{"given":"Shiho","family":"Morishita","sequence":"first","affiliation":[]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,28]]},"reference":[{"issue":"1","key":"9661_CR1","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/61.974213","volume":"17","author":"NG Boulaxis","year":"2002","unstructured":"Boulaxis NG, Papadopoulos MP (2002) Optimal feeder routing in distribution system planning using dynamic programming technique and GIS facilities. IEEE Trans Power Deliv 17(1):242\u2013247","journal-title":"IEEE Trans Power Deliv"},{"key":"9661_CR2","doi-asserted-by":"crossref","unstructured":"Chekuri C, Mydlarz M, Shepherd FB (2007) Multicommodity demand flow in a tree and packing integer programs. ACM Trans Algorithm 3(3):Art No 27","DOI":"10.1145\/1273340.1273343"},{"key":"9661_CR3","unstructured":"Chekuri C, Ene A, Korula N (2009) Unsplitable flow in paths and trees and column-restricted packing integer programs, Proceedings APPROX-RANDOM 2009. Lecture Notes in Computer Science, vol 5687, Springer, Berlin, pp 42\u201355"},{"issue":"1","key":"9661_CR4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo G, Grigoriadis MD, Tarjan RE (1989) A fast parametric maximum flow algorithm and applications. SIAM J Comput 18(1):30\u201355","journal-title":"SIAM J Comput"},{"key":"9661_CR5","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"9661_CR6","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:803\u2013827","journal-title":"Int J Found Comput Sci"},{"key":"9661_CR7","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 Discret Algorithms 6:627\u2013650","journal-title":"J Discret Algorithms"},{"key":"9661_CR8","doi-asserted-by":"crossref","first-page":"2620","DOI":"10.1016\/j.dam.2008.08.012","volume":"157","author":"T Ito","year":"2009","unstructured":"Ito T, Zhou X, Nishizeki T (2009) Partitioning graphs of supply and demand. Discret Appl Math 157:2620\u20132633","journal-title":"Discret Appl Math"},{"key":"9661_CR9","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:400\u2013415","journal-title":"Algorithmica"},{"issue":"6","key":"9661_CR10","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1587\/transfun.E96.A.1036","volume":"E96\u2013A","author":"M Kawabata","year":"2013","unstructured":"Kawabata M, Nishizeki T (2013) Partitioning trees with supply, demand and edge-capacity. IEICE Trans Fundam Electron Commun Comput Sci E96\u2013A(6):1036\u20131043","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"issue":"6","key":"9661_CR11","doi-asserted-by":"crossref","first-page":"1162","DOI":"10.1287\/opre.20.6.1162","volume":"20","author":"E Minieka","year":"1972","unstructured":"Minieka E (1972) Parametric network flows. Oper Res 20(6):1162\u20131170","journal-title":"Oper Res"},{"key":"9661_CR12","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1109\/61.871365","volume":"15","author":"AB Morton","year":"2000","unstructured":"Morton AB, Mareels IMY (2000) An efficient brute-force solution to the network reconfiguration problem. IEEE Trans Power Deliv 15:996\u20131000","journal-title":"IEEE Trans Power Deliv"},{"key":"9661_CR13","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/61.974215","volume":"17","author":"J-H Teng","year":"2002","unstructured":"Teng J-H, Lu C-N (2002) Feeder-switch relocation for customer interruption cost minimization. IEEE Trans Power Deliv 17:254\u2013259","journal-title":"IEEE Trans Power Deliv"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9661-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9661-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9661-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T07:48:47Z","timestamp":1564127327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9661-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,28]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9661"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9661-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,28]]}}}