{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T14:56:42Z","timestamp":1693061802707},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"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":[[1982,12]]},"DOI":"10.1007\/bf01581048","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:55:29Z","timestamp":1114667729000},"page":"350-357","source":"Crossref","is-referenced-by-count":9,"title":["An accelerated covering relaxation algorithm for solving 0\u20131 positive polynomial programs"],"prefix":"10.1007","volume":"22","author":[{"given":"Daniel","family":"Granot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frieda","family":"Granot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willem","family":"Vaessen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.13.4.517","volume":"13","author":"E. Balas","year":"1965","unstructured":"E. Balas, \u201cAn additive algorithm for solving linear programs with zero\u2013one variables\u201d,Operations Research 13 (1965) 517\u2013546.","journal-title":"Operations Research"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1287\/opre.25.5.760","volume":"25","author":"J. Etcheberry","year":"1977","unstructured":"J. Etcheberry, \u201cThe set covering problem: A new implicit enumeration algorithm\u201d,Operations Research 25 (1977) 760\u2013772.","journal-title":"Operations Research"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/mnsc.25.3.264","volume":"25","author":"D. Granot","year":"1979","unstructured":"D. Granot, F. Granot and J. Kallberg, \u201cCovering relaxation for positive 0\u20131 polynomial programs\u201d,Management Science 25 (1979) 264\u2013273.","journal-title":"Management Science"},{"key":"CR4","series-title":"Working Paper","volume-title":"An accelerated covering relaxation algorithm for solving 0\u20131 positive polynomial programs","author":"D. Granot","year":"1980","unstructured":"D. Granot, F. Granot and W. Vaessen, \u201cAn accelerated covering relaxation algorithm for solving 0\u20131 positive polynomial programs\u201d, Working Paper 718, Faculty of Commerce and Business Administration, U.B.C., Vancouver, B.C. (March 1980)."},{"key":"CR5","series-title":"Working Paper","volume-title":"Efficient heuristic algorithms for positive 0\u20131 polynomial programming problems","author":"F. Granot","year":"1978","unstructured":"F. Granot, \u201cEfficient heuristic algorithms for positive 0\u20131 polynomial programming problems\u201d, Working Paper 595, Faculty of Commerce and Business Administration, U.B.C., Vancouver, B.C. (August 1978). (To appear inManagement Science.)"},{"key":"CR6","volume-title":"Covering relaxation methods for solving the zero\u2013one positive polynomial programming problems","author":"W. Vaessen","year":"1980","unstructured":"W. Vaessen, \u201cCovering relaxation methods for solving the zero\u2013one positive polynomial programming problems\u201d, M.Sc. Thesis, Computer Science Department, U.B.C., Vancouver, B.C. (May 1980)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581048.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581048\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:14Z","timestamp":1556881934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["BF01581048"],"URL":"https:\/\/doi.org\/10.1007\/bf01581048","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}