{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T13:35:48Z","timestamp":1648647348009},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,30]],"date-time":"2015-11-30T00:00:00Z","timestamp":1448841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"RSF","award":["14-41-00039"],"award-info":[{"award-number":["14-41-00039"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s11590-015-0975-3","type":"journal-article","created":{"date-parts":[[2015,11,30]],"date-time":"2015-11-30T08:31:08Z","timestamp":1448872268000},"page":"407-418","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["k-Sum decomposition of strongly unimodular matrices"],"prefix":"10.1007","volume":"11","author":[{"given":"K.","family":"Papalamprou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Pitsoulis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,30]]},"reference":[{"key":"975_CR1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02591849","volume":"38","author":"M Conforti","year":"1987","unstructured":"Conforti, M., Rao, M.R.: Structural properties and recognition of restricted and strongly unimodular matrices. Math. Program. 38, 17\u201327 (1987)","journal-title":"Math. Program."},{"key":"975_CR2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0166-218X(86)90044-2","volume":"15","author":"Y Crama","year":"1986","unstructured":"Crama, Y., Hammer, P.L., Ibaraki, T.: Strong unimodularity for matrices and hypergraphs. Discret. Appl. Math. 15, 221\u2013239 (1986)","journal-title":"Discret. Appl. Math."},{"key":"975_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0012-365X(92)90048-K","volume":"102","author":"Y Crama","year":"1992","unstructured":"Crama, Y., Loebl, M., Poljac, S.: A decomposition of strongly unimodular matrices into incidence matrices of digraphs. Discret. Math. 102, 143\u2013147 (1992)","journal-title":"Discret. Math."},{"key":"975_CR4","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Springer, Berlin (2005)"},{"key":"975_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds and Markets: Reasoning for a Highly Connected World","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds and Markets: Reasoning for a Highly Connected World. Cambridge University Press, Cambridge (2010)"},{"key":"975_CR6","doi-asserted-by":"crossref","DOI":"10.2307\/j.ctvcm4gh1","volume-title":"Social and Economic Networks","author":"MO Jackson","year":"2010","unstructured":"Jackson, M.O.: Social and Economic Networks. Princeton University Press, Princeton (2010)"},{"key":"975_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0012-365X(89)90322-1","volume":"76","author":"M Loebl","year":"1989","unstructured":"Loebl, M., Poljac, S.: A hierarchy of totally unimodular matrices. Discret. Math. 76, 241\u2013246 (1989)","journal-title":"Discret. Math."},{"key":"975_CR8","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, Oxford (1988)"},{"key":"975_CR9","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"MJ Newman","year":"2010","unstructured":"Newman, M.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)"},{"key":"975_CR10","volume-title":"Matroid Theory","author":"J Oxley","year":"2006","unstructured":"Oxley, J.: Matroid Theory. Oxford University Press, Oxford (2006)"},{"key":"975_CR11","doi-asserted-by":"crossref","first-page":"5024","DOI":"10.1016\/j.disc.2009.03.010","volume":"309","author":"L Pitsoulis","year":"2009","unstructured":"Pitsoulis, L., Papalamprou, K., Appa, G., Kotnyek, B.: On the representability of totally unimodular matrices on bidirected graphs. Discret. Math. 309, 5024\u20135042 (2009)","journal-title":"Discret. Math."},{"key":"975_CR12","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Oxford (1986)"},{"key":"975_CR13","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"PD Seymour","year":"1980","unstructured":"Seymour, P.D.: Decomposition of regular matroids. J. Comb. Theory Ser. B 28, 305\u2013359 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"key":"975_CR14","first-page":"527","volume-title":"Matroid Minors. Handbook of Combinatorics","author":"PD Seymour","year":"1980","unstructured":"Seymour, P.D.: Matroid Minors. Handbook of Combinatorics, vol. 1, pp. 527\u2013550. Elsevier, Amsterdam (1980)"},{"key":"975_CR15","doi-asserted-by":"crossref","unstructured":"van Steen, M.: Graph Theory and Complex Networks: An Introduction. Maarten van Steen, Amsterdam (2010)","DOI":"10.1057\/9780230106505_1"},{"key":"975_CR16","unstructured":"Truemper, K.: Matroid Decomposition. Leibniz, 1998"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0975-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0975-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0975-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0975-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T02:01:59Z","timestamp":1567389719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0975-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,30]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["975"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0975-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,30]]}}}