{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T02:05:35Z","timestamp":1763258735792},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9329,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1988]]},"DOI":"10.1016\/0012-365x(88)90149-5","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:32:03Z","timestamp":1034271123000},"page":"207-212","source":"Crossref","is-referenced-by-count":4,"title":["A multiply constrained matroid optimization problem"],"prefix":"10.1016","volume":"73","author":[{"given":"F.","family":"Rendl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Leclerc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(88)90149-5_BIB1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","article-title":"A weighted matroid intersection algorithm","volume":"2","author":"Frank","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(88)90149-5_BIB2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0196-6774(84)90042-7","article-title":"Efficient algorithms for a family of matroid intersection problems","volume":"5","author":"Gabow","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(88)90149-5_BIB3","series-title":"MSIS Series","article-title":"The generalized quasi-greedy algorithm for constrained minimum weight matroid bases","author":"Glover","year":"1985"},{"key":"10.1016\/0012-365X(88)90149-5_BIB4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0166-218X(84)90077-5","article-title":"Matroid optimization with the interleaving of two ordered sets","volume":"8","author":"Gusfield","year":"1984","journal-title":"Discr. Appl. Math."},{"key":"10.1016\/0012-365X(88)90149-5_BIB5","series-title":"Graphen, Netzwerke und Algorithmen","author":"Jungnickel","year":"1987"},{"key":"10.1016\/0012-365X(88)90149-5_BIB6","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0012-365X(88)90149-5_BIB7","series-title":"Matroid Theory","author":"Welsh","year":"1976"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88901495?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88901495?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:28:01Z","timestamp":1555118881000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X88901495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1988]]}},"alternative-id":["0012365X88901495"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(88)90149-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1988]]}}}