{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T10:09:04Z","timestamp":1648807744500},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"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":[[1985,12]]},"DOI":"10.1007\/bf00991179","type":"journal-article","created":{"date-parts":[[2005,1,9]],"date-time":"2005-01-09T16:20:08Z","timestamp":1105287608000},"page":"337-364","source":"Crossref","is-referenced-by-count":4,"title":["Minimal covering problem and PLA minimization"],"prefix":"10.1007","volume":"14","author":[{"given":"Ming Huei","family":"Young","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saburo","family":"Muroga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"E. J. McCluskey,Introduction to the Theory of Switching Circuits, McGraw-Hill (1965)."},{"key":"CR2","series-title":"Report No.","volume-title":"Ph.D. Dissertation","author":"M.-H. Young","year":"1979","unstructured":"M.-H. Young, The Minimal Covering Problem and Automated Design of Two-level AND\/OR Optimal Networks, Ph.D. Dissertation, Report No. UIUCDCS-R-79-966, Department Computer Science, University of Illinois, Urbana, 186 pp. (1979)."},{"key":"CR3","volume-title":"Logic Design and Switching Theory","author":"S. Muroga","year":"1979","unstructured":"S. Muroga,Logic Design and Switching Theory, John Wiley & Sons, New York (1979)."},{"key":"CR4","volume-title":"VLSI System Design","author":"S. Muroga","year":"1982","unstructured":"S. Muroga,VLSI System Design, John Wiley & Sons, New York (1982)."},{"key":"CR5","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 Programs with 0?1 Variables,Operations Research 13:517?546 (1965).","journal-title":"Operations Research"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"A. Cobham, R. Fridshal, and J. H. North, An Application of Linear Programming to the Minimization of Boolean Functions,Proc. Second Ann. Symp. Switching Circuit Theory and Logic Design, pp. 3?9 (1961).","DOI":"10.1109\/FOCS.1961.5"},{"issue":"1","key":"CR7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF01108520","volume":"1","author":"T. Ibaraki","year":"1972","unstructured":"T. Ibaraki, T. K. Liu, C. R. Baugh, and S. Muroga, An Implicit Enumeration Program for Zero-One Integer Programming,Int. J. of Comput. and Info. Sci. 1(1):75?92 (March 1972).","journal-title":"Int. J. of Comput. and Info. Sci."},{"key":"CR8","unstructured":"J. Haldi, 25 Integer Programming Test Problems, Working Paper No. 43, Graduate School of Business, Stanford University (December 1964)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/opre.17.3.437","volume":"17","author":"A. M. Geoffrion","year":"1969","unstructured":"A. M. Geoffrion, An Improved Implicit Enumeration Approach to Integer Programming,Operations Research 17:437?454 (1969).","journal-title":"Operations Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1287\/opre.16.5.928","volume":"16","author":"J. F. Shapiro","year":"1968","unstructured":"J. F. Shapiro, Group Theoretical Algorithms for the Integer Programming Problem-II: Extension to a General Algorithm,Oper. Res. 16:928?947 (1968).","journal-title":"Oper. Res."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1287\/mnsc.15.9.481","volume":"15","author":"C. A. Trauth","year":"1969","unstructured":"C. A. Trauth and R. E. Woolsey, Integer Linear Programming: A Study in Computational Efficiency,Man. Sci. 15:481?493 (1969).","journal-title":"Man. Sci."},{"issue":"3","key":"CR12","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/321832.321848","volume":"21","author":"L. E. Trotter Jr.","year":"1974","unstructured":"L. E. Trotter, Jr., and C. M. Shetty, An Algorithm for the Bounded Variable Integer Programming Problem,J. ACM 21(3):505?513 (July 1974).","journal-title":"J. ACM"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"D. R. Fulkerson, G. L. Nemhauser, and L.E. Trotter, Jr., Two Computationally Difficult Set Covering Problems That Arise in Computing the 1-Width of Steiner Triple Systems, Mathematical Programming Study 2, North-Holland Publishing Company, pp. 72?81 (1974).","DOI":"10.1007\/BFb0120689"},{"key":"CR14","unstructured":"Computer Characteristic Quarterly, Adams Associates, Inc. (1968)."},{"key":"CR15","unstructured":"Standard EDP Report, Auerbach Info., Inc. (1972)."},{"key":"CR16","unstructured":"A. Cobham, R. Fridshal, and J. H. North, A Statistical Study of the Minimization of Boolean Functions Using Integer Programming, IBM Research Report, RC-756 (1962)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1109\/T-C.1970.222888","volume":"C-19","author":"R. M. Bowman","year":"1970","unstructured":"R. M. Bowman and E. S. McVey, A Method for the Fast Approximate Solutions of Large Prime Implicant Charts,IEEE Trans. Comput. C-19:169?173 (February 1970).","journal-title":"IEEE Trans. Comput."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/opre.17.3.455","volume":"17","author":"R. Roth","year":"1969","unstructured":"R. Roth, Computer Solution to Minimum-covering Problems,Operations Research,17: 455?465 (1969).","journal-title":"Operations Research"},{"key":"CR19","volume-title":"Report No.","author":"M.-H. Young","year":"1978","unstructured":"M.-H. Young, ?Program Manual of Programs for Minimal Covering Problems: ILLOD-MINIC-B, ILLOD-MINIC-BP, ILLOD-MINIC-BS, ILLOD-MINIC-BA, ILLOD-MINIC-BG,? Report No. UIUCDCS-R-78-924, Department of Computer Science, University of Illinois, Urbana (1978)."},{"issue":"6","key":"CR20","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1109\/TC.1985.5009404","volume":"C-34","author":"M.-H. Young","year":"1985","unstructured":"M.-H. Young and S. Muroga, Symmetric Minimal Covering Problem and Minimal PLAs with Symmetric Variables,IEEE Trans. Comput. C-34(6): 523?541 (June 1985).","journal-title":"IEEE Trans. Comput."},{"key":"CR21","volume-title":"Report No. UIUCDCS-R-78-926","author":"M.-H. Young","year":"1978","unstructured":"M.-H. Young and R. B. Cutler, Program Manual for the Programs ILLOD-MINSUM-CBS, ILLOD-MINSUM-CBSA, ILLOD-MINSUM-CBG, ILLOD-MINSUM-CBGM, to Derive Minimal Sums or Irredundant Disjunctive Forms for Switching Functions, Report No. UIUCDCS-R-78-926, Department of Computer Science, University of Illinois, Urbana (1978)."},{"key":"CR22","volume-title":"User Manual for MINSUM-C System, Report","author":"H.-M. Xu","year":"1983","unstructured":"H.-M. Xu, User Manual for MINSUM-C System, Report, Department of Computer Science, University of Illinois, Urbana (1983)."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1287\/opre.15.5.892","volume":"15","author":"C. Lemke","year":"1967","unstructured":"C. Lemke and K. Spielberg, Direct Search 0?1 and Mixed Integer Programming,Operations Research 15:892?914 (1967).","journal-title":"Operations Research"}],"container-title":["International Journal of Computer & Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00991179.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00991179\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00991179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T08:10:13Z","timestamp":1586074213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00991179"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["BF00991179"],"URL":"https:\/\/doi.org\/10.1007\/bf00991179","relation":{},"ISSN":["0091-7036","1573-7640"],"issn-type":[{"value":"0091-7036","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}