{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T13:30:11Z","timestamp":1696167011912},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":12981,"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":[[1978]]},"DOI":"10.1016\/0012-365x(78)90083-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"103-116","source":"Crossref","is-referenced-by-count":7,"title":["Heuristically guided algorithm for k-parity matroid problems"],"prefix":"10.1016","volume":"21","author":[{"given":"P.M.","family":"Camerini","sequence":"first","affiliation":[]},{"given":"F.","family":"Maffioli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90083-3_BIB1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0020-0190(75)90021-6","article-title":"Bounds for 3-matroid intersection problems","volume":"3","author":"Camerini","year":"1975","journal-title":"Information Processing Lett."},{"key":"10.1016\/0012-365X(78)90083-3_BIB2","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","article-title":"On Improving relaxation methods by modified gradient techniques","volume":"3","author":"Camerini","year":"1975","journal-title":"Math. Programming Study"},{"key":"10.1016\/0012-365X(78)90083-3_BIB3","series-title":"Techn. Rep. 73-2 IEE-CNG","article-title":"Travelling salesman problem: heuristically guided search and modified gradient techniques","author":"Camerini","year":"1973"},{"key":"10.1016\/0012-365X(78)90083-3_BIB4","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. Programming"},{"issue":"2","key":"10.1016\/0012-365X(78)90083-3_BIB5","first-page":"100","article-title":"A formal basis of the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Systems, Man and Cybernet"},{"key":"10.1016\/0012-365X(78)90083-3_BIB6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01585505","article-title":"Improvements of the Held-Karp algorithm for the symmetric travelling-salesman problem","volume":"7","author":"Helbig Hansen","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(78)90083-3_BIB7","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The travelling salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(78)90083-3_BIB8","series-title":"Symp. on Complexity of Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0012-365X(78)90083-3_BIB9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01681329","article-title":"Matroid intersection algorithms","volume":"9","author":"Lawler","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(78)90083-3_BIB10","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0012-365X(78)90083-3_BIB11","series-title":"Combinatorial Algorithms","article-title":"Polynomial bounded and (apparently) non polynomial bounded matroid computations","author":"Lawler","year":"1972"},{"key":"10.1016\/0012-365X(78)90083-3_BIB12","article-title":"Matroids and heuristically guided search in problem solving","volume":"Vol. 2","author":"Maffioli","year":"1975"},{"key":"10.1016\/0012-365X(78)90083-3_BIB13","year":"1975"},{"key":"10.1016\/0012-365X(78)90083-3_BIB14","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Wolfe","year":"1974","journal-title":"Math. Programming"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78900833?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78900833?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:20:14Z","timestamp":1555154414000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X78900833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X78900833"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90083-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}