{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:13:10Z","timestamp":1770063190711,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0167-6377(92)90045-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"201-203","source":"Crossref","is-referenced-by-count":40,"title":["Separating from the dominant of the spanning tree polytope"],"prefix":"10.1016","volume":"12","author":[{"given":"Francisco","family":"Barahona","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90045-5_bib1","series-title":"On 2-connected subgraph polytopes","author":"Barahona","year":"1991"},{"key":"10.1016\/0167-6377(92)90045-5_bib2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0167-6377(89)90029-1","article-title":"On the spanning tree polyhedron","volume":"8","author":"Chopra","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(92)90045-5_bib3","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/3828.3829","article-title":"Optimal attack and reinforcement of a network","volume":"32","author":"Cunningham","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0167-6377(92)90045-5_bib4","article-title":"New primal and dual matching heuristics","author":"Ju\u00a8nger","year":"1991"},{"key":"10.1016\/0167-6377(92)90045-5_bib5","series-title":"Combinatorial Structures and Their Applications","first-page":"69","article-title":"Submodular functions, matroids and certain polyhedra","author":"Edmonds","year":"1970"},{"key":"10.1016\/0167-6377(92)90045-5_bib6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584085","article-title":"Blocking and anti-blocking pairs of polyhedra","volume":"1","author":"Fulkerson","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90045-5_bib7","article-title":"Facets for polyhedra arising in the design of communication networks with low connectivity constraints","author":"Gro\u00a8tschel","year":"1989"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792900455?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792900455?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:50:56Z","timestamp":1552902656000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637792900455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["0167637792900455"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90045-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}