{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:29:44Z","timestamp":1648711784663},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1975,1,1]],"date-time":"1975-01-01T00:00:00Z","timestamp":157766400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1975,1]]},"DOI":"10.1016\/0020-0190(75)90021-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:20:15Z","timestamp":1027642815000},"page":"81-83","source":"Crossref","is-referenced-by-count":4,"title":["Bounds for 3-matroid intersection problems"],"prefix":"10.1016","volume":"3","author":[{"given":"P.M.","family":"Camerini","sequence":"first","affiliation":[]},{"given":"F.","family":"Maffioli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(75)90021-6_BIB1","series-title":"Memo No ERL-M334","article-title":"Matroid with parity conditions: a new class of combinatorial optimization problems","author":"Lawler","year":"1971"},{"key":"10.1016\/0020-0190(75)90021-6_BIB2","series-title":"Symp. on Complexity of Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0020-0190(75)90021-6_BIB3","article-title":"Matroids and heuristically guided search in problem solving","author":"Maffioli","year":"1974","journal-title":"2nd European Meeting on Cybernetics and Systems Research"},{"key":"10.1016\/0020-0190(75)90021-6_BIB4","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling salesman problem and minimum spanning trees: part II","volume":"1","author":"Held","year":"1971","journal-title":"Mathem. Programm."},{"key":"10.1016\/0020-0190(75)90021-6_BIB5","first-page":"31","article-title":"A heuristically guided algorithm for the traveling salesman problem","volume":"4","author":"Camerini","year":"1973","journal-title":"J. of the Institution of Computer Sciences"},{"key":"10.1016\/0020-0190(75)90021-6_BIB6","series-title":"The many facets of graph theory","first-page":"155","article-title":"Matroids versus Graphs","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0190(75)90021-6_BIB7","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1287\/opre.20.5.1044","article-title":"Bounds for the traveling salesman problem","volume":"20","author":"Christofides","year":"1972","journal-title":"Oper. Res."},{"key":"10.1016\/0020-0190(75)90021-6_BIB8","article-title":"Relaxation methods improved by modified gradient techniques","author":"Camerini","year":"1974","journal-title":"Conf. on Opns. Res."},{"key":"10.1016\/0020-0190(75)90021-6_BIB9","series-title":"Memo No ERL-M332","article-title":"Polynomial bounded and (apparently) non-polynomial bounded matroid computation","author":"Lawler","year":"1972"},{"key":"10.1016\/0020-0190(75)90021-6_BIB10","series-title":"Memo No. ERL-M333","article-title":"Matroid intersection algorithms","author":"Lawler","year":"1971"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019075900216?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019075900216?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:50:52Z","timestamp":1555059052000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019075900216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,1]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1975,1]]}},"alternative-id":["0020019075900216"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(75)90021-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1975,1]]}}}