{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:42:18Z","timestamp":1648885338591},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1972,3,1]],"date-time":"1972-03-01T00:00:00Z","timestamp":68256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer and Information Sciences"],"published-print":{"date-parts":[[1972,3]]},"DOI":"10.1007\/bf01108520","type":"journal-article","created":{"date-parts":[[2005,2,5]],"date-time":"2005-02-05T12:54:17Z","timestamp":1107608057000},"page":"75-92","source":"Crossref","is-referenced-by-count":10,"title":["An implicit enumeration program for zero-one integer programming"],"prefix":"10.1007","volume":"1","author":[{"given":"T.","family":"Ibaraki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. K.","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. R.","family":"Baugh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muroga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","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, ?An additive algorithm for solving linear programming with zero-one variables,?Operations Res. 13(4):517?544 (1965).","journal-title":"Operations Res."},{"issue":"5","key":"CR2","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1287\/opre.15.5.915","volume":"15","author":"E. Balas","year":"1967","unstructured":"E. Balas, ?Discrete programming by the filter method,?Operations Res. 15(5):915?955 (1967).","journal-title":"Operations Res."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","volume":"12","author":"M. L. Balinski","year":"1965","unstructured":"M. L. Balinski, ?Integer programming; methods, uses, computation,?Management Sci. 12:253?313 (1965).","journal-title":"Management Sci."},{"key":"CR4","unstructured":"C. R. Baugh, T. Ibaraki, and S. Muroga, ?Computational experience in all-integer, binary variable, integer programming problems using Gomory's all-integer algorithm,? Report No. 259, Department of Computer Science, University of Illinois, April 1968."},{"key":"CR5","unstructured":"C. R. Baugh, T. Ibaraki, T. K. Liu, and S. Muroga, ?Optimum network design using NOR and NOR-AND gates by integer programming,? Report No. 293, Department of Computer Science, University of Illinois, January 1969."},{"issue":"3","key":"CR6","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M. Bellmore","year":"1968","unstructured":"M. Bellmore and G. L. Nemhauser, ?The traveling salesman problem: A survey,?Operations Res. 16(3):548?558 (1968).","journal-title":"Operations Res."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"A. Cobham, R. Fridshal, and J. H. North, ?An application of linear programming to the minimization of Boolean functions,?Proceedings of the Second Annual Symposium of Switching Circuit Theory and Logical Design, 1961, pp. 3?9.","DOI":"10.1109\/FOCS.1961.5"},{"issue":"1","key":"CR8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/opre.15.1.153","volume":"15","author":"B. Fleischmann","year":"1967","unstructured":"B. Fleischmann, ?Computational experience with the algorithm of Balas,?Operations Res. 15(1):153?155 (1967).","journal-title":"Operations Res."},{"issue":"5","key":"CR9","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.14.5.935","volume":"14","author":"R. J. Freeman","year":"1966","unstructured":"R. J. Freeman, ?Computational experience with a ?Balasian? integer programming algorithm,?Operations Res. 14(5):935?942 (1966).","journal-title":"Operations Res."},{"issue":"2","key":"CR10","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/1009031","volume":"9","author":"A. M. Geoffrion","year":"1967","unstructured":"A. M. Geoffrion, ?Integer programming by implicit enumeration and Balas' method,?SIAM Rev. 9(2):178?190 (1967).","journal-title":"SIAM Rev."},{"key":"CR11","unstructured":"A. M. Geoffrion, ?An improved implicit enumeration approach for integer programming,? The RAND Corporation, Memorandum, RM-5644-PR, June 1968; alsoOperations Res. 17:437?454 (1969)."},{"issue":"6","key":"CR12","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1287\/opre.13.6.879","volume":"13","author":"F. Glover","year":"1965","unstructured":"F. Glover, ?A multiple phase-dual algorithm for the zero-one integer programming problem,?Operations Res. 13(6):879?919 (1965).","journal-title":"Operations Res."},{"issue":"4","key":"CR13","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.16.4.741","volume":"16","author":"F. Glover","year":"1968","unstructured":"F. Glover, ?Surrogate constraints,?Operations Res. 16(4):741?749 (1968).","journal-title":"Operations Res."},{"key":"CR14","volume-title":"Industrial Scheduling","author":"R. E. Gomory","year":"1963","unstructured":"R. E. Gomory, ?An all-integer integer programming algorithm,? inIndustrial Scheduling, J. R. Muth and G. L. Thompson, eds. (Prentice-Hall, Englewood Cliffs, N.J., 1963)."},{"key":"CR15","unstructured":"J. Haldi, ?25 integer programming test problems,? Working Paper no. 43, Graduate School of Business, Stanford University, December 1964."},{"issue":"3","key":"CR16","first-page":"198","volume":"EC-12","author":"L. Hellerman","year":"1963","unstructured":"L. Hellerman, ?A catalog of three variable OR-invert and AND-invert logical circuits,?IEEETEC EC-12(3):198?223 (1963).","journal-title":"IEEETEC"},{"key":"CR17","unstructured":"T. Ibaraki, T. K. Liu, C. R. Baugh, and S. Muroga, ?An implicit enumeration program for zero-one integer programming,? Report no. 305, Department of Computer Science, University of Illinois, January 1969."},{"key":"CR18","volume-title":"Lecture Notes in Mathematics, Vol. 23","author":"P. L. Iv?nescu","year":"1966","unstructured":"P. L. Iv?nescu and S. Rudeanu, ?Pseudo-Boolean methods for bivalent programming,? inLecture Notes in Mathematics, Vol. 23 (Springer-Verlag, Berlin-Heidelberg-New York, 1966); alsoOperations Res. 17:233?261 (1969)."},{"issue":"4","key":"CR19","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"E. L. Lawler","year":"1966","unstructured":"E. L. Lawler and D. E. Wood, ?Branch-and-bound methods: A survey,?Operations Res. 14(4):699?719 (1966).","journal-title":"Operations Res."},{"issue":"5","key":"CR20","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1287\/opre.15.5.892","volume":"15","author":"C. E. Lemke","year":"1967","unstructured":"C. E. Lemke and K. Spielberg, ?Direct search algorithm for zero-one and mixed-integer programming,?Operations Res. 15(5):892?914 (1967).","journal-title":"Operations Res."},{"key":"CR21","unstructured":"T. K. Liu, ?A code for zero-one integer linear programming by implicit enumeration,? Master's thesis, Department of Computer Science, University of Illinois, December 1968."},{"key":"CR22","volume-title":"Introduction to the Theory of Switching Circuits","author":"E. J. McCluskey","year":"1965","unstructured":"E. J. McCluskey,Introduction to the Theory of Switching Circuits (McGraw-Hill, New York, 1965)."},{"key":"CR23","unstructured":"S. Muroga and T. Ibaraki, ?Logical design of an optimum network by integer linear programming?Part I,? Report no. 264, Department of Computer Science, University of Illinois, July 1968."},{"key":"CR24","unstructured":"S. Muroga and T. Ibaraki, ?Logical design of an optimum network by integer linear programming?Part II,? Report no. 289, Department of Computer Science, University of Illinois, December 1968."},{"issue":"9","key":"CR25","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.13.9.736","volume":"13","author":"C. C. Peterson","year":"1967","unstructured":"C. C. Peterson, ?Computational experience with variants of the Balas algorithm applied to the selection of R and D projects,?Management Sci. 13(9):736?750 (1967).","journal-title":"Management Sci."},{"key":"CR26","volume-title":"Sc. D. Thesis","author":"D. Shapiro","year":"1966","unstructured":"D. Shapiro, ?Algorithms for the solution of the optimal cost traveling salesman problem,? Sc. D. Thesis, Washington University, St. Louis, January 1966."},{"key":"CR27","unstructured":"S. Woiler, ?Implicit enumeration algorithms for discrete optimization problems,? Report no. 4, Department of Industrial Engineering, Stanford University, May 1967."},{"key":"CR28","series-title":"Working Paper","volume-title":"Implicit enumeration using bounds on variables: A generalization of Balas' additive algorithm for solving linear programs with zero-one variables","author":"S. Zionts","year":"1968","unstructured":"S. Zionts, ?Implicit enumeration using bounds on variables: A generalization of Balas' additive algorithm for solving linear programs with zero-one variables,? Working Paper no. 7, School of Business Administration, State University of New York at Buffalo, Buffalo, New York, June 1968."}],"container-title":["International Journal of Computer & Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01108520.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01108520\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01108520","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T13:24:11Z","timestamp":1556717051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01108520"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,3]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1972,3]]}},"alternative-id":["BF01108520"],"URL":"https:\/\/doi.org\/10.1007\/bf01108520","relation":{},"ISSN":["0091-7036","1573-7640"],"issn-type":[{"value":"0091-7036","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1972,3]]}}}