{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:30:25Z","timestamp":1759667425137},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1007\/bf01581157","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:41:12Z","timestamp":1114666872000},"page":"403-405","source":"Crossref","is-referenced-by-count":5,"title":["Matroids and a forest cover problem"],"prefix":"10.1007","volume":"66","author":[{"given":"J. Orestes","family":"Cerdeira","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"J.O. Cerdeira and C.J. Luz, \u201cCovering nodes with a fixed number of trees,\u201d Technical report, Nota no. 3\/85, Centro de Estat\u00edstica e Aplica\u00e7\u00f5es, Lisboa\/I.N.I.C."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0167-5060(08)70817-3","volume":"4","author":"J. Edmonds","year":"1979","unstructured":"J. Edmonds, \u201cMatroid intersection,\u201dAnnals of Discrete Mathematics 4 (1979) 39\u201349.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01589096","volume":"45","author":"A.B. Gamble","year":"1989","unstructured":"A.B. Gamble and W.R. Pulleyblank, \u201cForest covers and a polyhedral intersection theorem,\u201dMathematical Programming 45 (1989) 49\u201358.","journal-title":"Mathematical Programming"},{"key":"CR4","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Rinehart and Winston, New York, 1976)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0121014","volume":"21","author":"L.J. White","year":"1971","unstructured":"L.J. White, \u201cMinimum covers of fixed cardinality in weighted graphs,\u201dSIAM Journal of Applied Mathematics 21 (1971) 104\u2013113.","journal-title":"SIAM Journal of Applied Mathematics"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581157.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581157\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:15Z","timestamp":1556881935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["BF01581157"],"URL":"https:\/\/doi.org\/10.1007\/bf01581157","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}