{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T13:16:05Z","timestamp":1680441365555},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,7,26]],"date-time":"2015-07-26T00:00:00Z","timestamp":1437868800000},"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":["Math. Program."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10107-015-0936-8","type":"journal-article","created":{"date-parts":[[2015,7,25]],"date-time":"2015-07-25T11:21:07Z","timestamp":1437823267000},"page":"565-574","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Extended formulations for sparsity matroids"],"prefix":"10.1007","volume":"158","author":[{"given":"Satoru","family":"Iwata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoyuki","family":"Kamiyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuji","family":"Kijima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,26]]},"reference":[{"key":"936_CR1","doi-asserted-by":"crossref","unstructured":"Conforti, M., Kaibel, V., Walter, M., Weltge, S.: Subgraph polytopes and independence polytopes of count matroids. arXiv:1502.02817 [cs.DM] (2015)","DOI":"10.1016\/j.orl.2015.06.011"},{"key":"936_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Program. 1, 127\u2013136 (1971)","journal-title":"Math. Program."},{"key":"936_CR3","doi-asserted-by":"publisher","unstructured":"Faenza, Y., Fiorini, S., Grappe, R., Tiwary, H.R.: Extended formulations, nonnegative factorizations, and randomized communication protocols. Math. Program. (2015). doi: 10.1007\/s10107-014-0755-3","DOI":"10.1007\/s10107-014-0755-3"},{"key":"936_CR4","doi-asserted-by":"publisher","unstructured":"Goemans, M.X.: Smallest compact formulation for the permutahedron. Math. Program. (2015). doi: 10.1007\/s10107-014-0757-1","DOI":"10.1007\/s10107-014-0757-1"},{"key":"936_CR5","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0016-0032(65)90340-6","volume":"279","author":"SL Hakimi","year":"1965","unstructured":"Hakimi, S.L.: On the degrees of the vertices of a directed graphs. J. Frankl. Inst. 279, 290\u2013308 (1965)","journal-title":"J. Frankl. Inst."},{"key":"936_CR6","unstructured":"Hirahara, S., Imai, H.: On extended complexity of generalized transversal matroids. IEICE Technical Report, COMP2014-25 114, 1\u20134 (2014)"},{"key":"936_CR7","first-page":"186","volume":"26","author":"H Imai","year":"1983","unstructured":"Imai, H.: Network-flow algorithms for lower-truncated transversal polymatroids. J. Oper. Res. Soc. Japan 26, 186\u2013210 (1983)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"936_CR8","doi-asserted-by":"crossref","unstructured":"Kaibel, V., Lee, J., Walter, M., Weltge, S.: A quadratic upper bound on the extension complexities of the independence polytopes of regular matroids. arXiv:1504.03872 [cs.DM] (2015)","DOI":"10.1007\/s00373-016-1709-8"},{"key":"936_CR9","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01534980","volume":"4","author":"G Laman","year":"1970","unstructured":"Laman, G.: On graphs and rigidity of plane skeletal structures. J. Eng. Math. 4, 331\u2013340 (1970)","journal-title":"J. Eng. Math."},{"key":"936_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","volume":"10","author":"RK Martin","year":"1991","unstructured":"Martin, R.K.: Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10, 119\u2013128 (1991)","journal-title":"Oper. Res. Lett."},{"key":"936_CR11","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"s1\u201336","author":"CSJA Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.S.J.A.: Edge-disjoint spanning trees of finite graphs. J. Lond. Math. Soc. s1\u201336, 445\u2013450 (1961)","journal-title":"J. Lond. Math. Soc."},{"key":"936_CR12","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10107-012-0574-3","volume":"142","author":"T Rothvoss","year":"2013","unstructured":"Rothvoss, T.: Some 0\/1 polytopes need exponential size extended formulations. Math. Program., 142, 255\u2013268 (2013)","journal-title":"Math. Program.,"},{"key":"936_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. Theo. Ser. B 28, 305\u2013359 (1980)","journal-title":"J. Comb. Theo. Ser. B"},{"key":"936_CR14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.26493\/1855-3974.197.461","volume":"4","author":"I Streinu","year":"2011","unstructured":"Streinu, I., Theran, L.: Natural realizations of sparsity matroids. Ars Math. Contemp. 4, 141\u2013151 (2011)","journal-title":"Ars Math. Contemp."},{"key":"936_CR15","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0095-8956(84)90016-9","volume":"36","author":"T-S Tay","year":"1984","unstructured":"Tay, T.-S.: Rigidity of multi-graphs. I. Linking rigid bodies in $$n$$ n -space. J. Comb. Theo. Ser. B 36, 95\u2013112 (1984)","journal-title":"J. Comb. Theo. Ser. B"},{"key":"936_CR16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/net.10010","volume":"39","author":"JC Williams","year":"2002","unstructured":"Williams, J.C.: A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs. Networks 39, 53\u201360 (2002)","journal-title":"Networks"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0936-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0936-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0936-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T01:31:49Z","timestamp":1652923909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0936-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,26]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["936"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0936-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,26]]}}}