{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T01:43:16Z","timestamp":1648690996959},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1979,1]]},"DOI":"10.1016\/0305-0548(79)90015-7","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"47-51","source":"Crossref","is-referenced-by-count":2,"title":["Linear 0\u20131 programming: A comparison of implicit enumeration algorithms"],"prefix":"10.1016","volume":"6","author":[{"given":"Subhash C.","family":"Narula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph R.","family":"Kindorf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(79)90015-7_BIB1","series-title":"Discrete Optimization","author":"Plane","year":"1971"},{"key":"10.1016\/0305-0548(79)90015-7_BIB2","series-title":"Linear and Integer Programming","author":"Zionts","year":"1974"},{"key":"10.1016\/0305-0548(79)90015-7_BIB3","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1287\/opre.15.5.892","article-title":"Direct Search Algorithms for Zero\u2013One and Mixed Integer Programming","volume":"15","author":"Lemke","year":"1967","journal-title":"Operations Research"},{"key":"10.1016\/0305-0548(79)90015-7_BIB4","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.13.9.736","article-title":"Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R & D Projects","volume":"13","author":"Peterson","year":"1967","journal-title":"Management Science"},{"key":"10.1016\/0305-0548(79)90015-7_BIB5","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.13.4.517","article-title":"An Additive Algorithm for Solving Linear Programming in Zero-One Variables","volume":"13","author":"Balas","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/0305-0548(79)90015-7_BIB6","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/opre.17.3.437","article-title":"An Improved Implicit Enumeration Approach for Integer Programming","volume":"17","author":"Geoffrion","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/0305-0548(79)90015-7_BIB7","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1287\/mnsc.21.5.591","article-title":"A Computational Survey of Methods for the Set Covering Problem","volume":"21","author":"Christofides","year":"1975","journal-title":"Management Science"},{"key":"10.1016\/0305-0548(79)90015-7_BIB8","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/BF01580448","article-title":"Resolution of the 0\u20131 Knapsack Problem: Comparison of Methods","volume":"8","author":"Fayard","year":"1975","journal-title":"Mathematical Programming"},{"key":"10.1016\/0305-0548(79)90015-7_BIB9","series-title":"Boolean Methods in Operations Research","author":"Hammer","year":"1968"},{"key":"10.1016\/0305-0548(79)90015-7_BIB10","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/nav.3800190115","article-title":"Generalized Implicit Enumeration Using Bounds on Variables for Solving Linear Programs with Zero-One Variables","volume":"19","author":"Zionts","year":"1972","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/0305-0548(79)90015-7_BIB11","first-page":"445","article-title":"Algorithm 449, Solution of Linear Programming Problem in 0\u20131 Variables [H]","volume":"16","author":"Fiala","year":"1973"},{"key":"10.1016\/0305-0548(79)90015-7_BIB12","series-title":"Optimization Techniques with Fortran","author":"Keuster","year":"1973"},{"key":"10.1016\/0305-0548(79)90015-7_BIB13","first-page":"437","article-title":"Algorithm 333, MINIT Algorithm for Linear Programming","volume":"11","author":"Salazar","year":"1968","journal-title":"Commun. Assoc. for Computing Mach."},{"key":"10.1016\/0305-0548(79)90015-7_BIB14","series-title":"Statistical Principles in Experimental Design","author":"Winer","year":"1971"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054879900157?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054879900157?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:26:55Z","timestamp":1552926415000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054879900157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,1]]}},"alternative-id":["0305054879900157"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(79)90015-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1979,1]]}}}