{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T15:35:54Z","timestamp":1775835354017,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["KA 1616\/4-1"],"award-info":[{"award-number":["KA 1616\/4-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1016\/j.orl.2015.06.011","type":"journal-article","created":{"date-parts":[[2015,7,5]],"date-time":"2015-07-05T07:39:19Z","timestamp":1436081959000},"page":"457-460","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["Subgraph polytopes and independence polytopes of count matroids"],"prefix":"10.1016","volume":"43","author":[{"given":"Michele","family":"Conforti","sequence":"first","affiliation":[]},{"given":"Volker","family":"Kaibel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6615-5983","authenticated-orcid":false,"given":"Matthias","family":"Walter","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Weltge","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.orl.2015.06.011_br000005","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1287\/moor.2014.0673","article-title":"Forbidden vertices","volume":"40","author":"Angulo","year":"2015","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.orl.2015.06.011_br000010","series-title":"Discrete Optimisation, Volume II","first-page":"3","article-title":"Disjunctive programming","author":"Balas","year":"1979"},{"issue":"1","key":"10.1016\/j.orl.2015.06.011_br000015","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","article-title":"Matroids and the greedy algorithm","volume":"1","author":"Edmonds","year":"1971","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2015.06.011_br000020","series-title":"Combinatorial Optimization","first-page":"129","article-title":"Extended formulations, nonnegative factorizations, and randomized communication protocols","author":"Faenza","year":"2012"},{"key":"10.1016\/j.orl.2015.06.011_br000025","series-title":"Connections in Combinatorial Optimization","author":"Frank","year":"2011"},{"key":"10.1016\/j.orl.2015.06.011_br000030","unstructured":"S. Iwata, N. Kamiyama, N. Katoh, S. Kijima, Y. Okamoto, Extended formulations for sparsity matroids, 2014. arXiv:1403.7272."},{"issue":"3","key":"10.1016\/j.orl.2015.06.011_br000035","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","article-title":"Using separation algorithms to generate mixed integer model reformulations","volume":"10","author":"Martin","year":"1991","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/j.orl.2015.06.011_br000040","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","article-title":"Edge-disjoint spanning trees of finite graphs","volume":"1","author":"Nash-Williams","year":"1961","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.orl.2015.06.011_br000045","first-page":"1","article-title":"Some 0\/1 polytopes need exponential size extended formulations","author":"Rothvoss","year":"2013","journal-title":"Math. Program. A"},{"issue":"1","key":"10.1016\/j.orl.2015.06.011_br000050","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/net.10010","article-title":"A linear-size zero\u2013one programming model for the minimum spanning tree problem in planar graphs","volume":"39","author":"Williams","year":"2002","journal-title":"Networks"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763771500084X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763771500084X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T22:34:13Z","timestamp":1759098853000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016763771500084X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["S016763771500084X"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2015.06.011","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2015,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Subgraph polytopes and independence polytopes of count matroids","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2015.06.011","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}