{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:20:09Z","timestamp":1649010009729},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":[[1985,1]]},"DOI":"10.1007\/bf02591862","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:40:07Z","timestamp":1175168407000},"page":"67-77","source":"Crossref","is-referenced-by-count":1,"title":["A decomposition algorithm for linear relaxation of the weightedr-covering problem"],"prefix":"10.1007","volume":"31","author":[{"given":"S.","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. K.","family":"Mittal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02591862_CR1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01583800","volume":"23","author":"S. Agarwal","year":"1982","unstructured":"S. Agarwal, A.K. Mittal and P. Sharma, \u201cAn extension of the edge covering problem\u201d,Mathematical Programming 23 (1982) 353\u2013356.","journal-title":"Mathematical Programming"},{"key":"BF02591862_CR2","volume-title":"Combinatorial optimization: Networks and matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial optimization: Networks and matroids (Holt, Reinhardt & Winston, NY, 1976)."},{"key":"BF02591862_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0020-0190(78)90016-9","volume":"7","author":"V.M. Malhotra","year":"1978","unstructured":"V.M. Malhotra, M.D. Kumar and S.N. Maheswari, \u201cAn (O|V|3) algorithm for finding maximum flows in networks\u201d,Information Processing Letters7 (1978) 277\u2013278.","journal-title":"Information Processing Letters"},{"key":"BF02591862_CR4","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"G.L. Nemhauser and R.E. Trotter, \u201cVertex packing structural properties and algorithms\u201d,Mathematical Programming8 (1975) 232\u2013248.","journal-title":"Mathematical Programming"},{"key":"BF02591862_CR5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01588228","volume":"17","author":"W.R. Pulleyblank","year":"1979","unstructured":"W.R. Pulleyblank, \u201cMinimum node covers and 2-bicritical graphs\u201d,Mathematical Programming 17 (1979) 91\u2013103.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591862.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591862\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:50Z","timestamp":1558381070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591862"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["BF02591862"],"URL":"https:\/\/doi.org\/10.1007\/bf02591862","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}