{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:40:17Z","timestamp":1759138817303,"version":"3.44.0"},"reference-count":44,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0167-9260(99)00017-6","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T15:45:15Z","timestamp":1043941515000},"page":"121-139","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["OKFDD minimization by genetic algorithms with application to circuit design"],"prefix":"10.1016","volume":"28","author":[{"given":"Rolf","family":"Drechsler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Becker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicole","family":"Drechsler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/S0167-9260(99)00017-6_BIB1","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithms for Boolean function manipulation","volume":"35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","article-title":"Symbolic Boolean manipulation with ordered binary decision diagrams","volume":"24","author":"Bryant","year":"1992","journal-title":"ACM Comput. Surveys"},{"issue":"2","key":"10.1016\/S0167-9260(99)00017-6_BIB3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1006\/inco.1995.1167","article-title":"On the relation between BDDs and FDDs","volume":"123","author":"Becker","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB4","unstructured":"R. Rudell, Dynamic variable ordering for ordered binary decision diagrams, in Intl Conf. on CAD, 1993, pp. 42\u201347."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB5","unstructured":"R. Drechsler, M. Theobald, B. Becker, Fast OFDD based minimization of fixed polarity Reed\u2013Muller expressions, in European Design Automation Conf., 1994, pp. 2\u20137."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB6","doi-asserted-by":"crossref","unstructured":"U. Kebschull, E. Schubert, W. Rosenstiel, Multilevel logic synthesis based on functional decision diagrams, in European Conf. on Design Automation, 1992, pp. 43\u201347.","DOI":"10.1109\/EDAC.1992.205890"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB7","doi-asserted-by":"crossref","unstructured":"R. Drechsler, B. Becker, Sympathy: fast exact minimization of fixed polarity Reed\u2013Muller expressions for symmetric functions, in European Design & Test Conf., 1995, pp. 91\u201397.","DOI":"10.1109\/EDTC.1995.470414"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB8","doi-asserted-by":"crossref","unstructured":"T. Sasao, Logic Synthesis and Optimization, Kluwer, Dordrecht, 1993.","DOI":"10.1007\/978-1-4615-3154-8"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB9","unstructured":"P. Ho, M.A. Perkowski, Free Kronecker decision diagrams and their application to Atmel 6000 FPGA mapping, in European Design Automation Conf., 1994, pp. 8\u201313."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB10","doi-asserted-by":"crossref","unstructured":"B. Becker, Synthesis for testability: binary decision diagrams, in STACS, Vol. 577, Lecture Notes in Computer Science, Springer, Berlin, 1992, pp. 501\u2013512.","DOI":"10.1007\/3-540-55210-3_208"},{"issue":"1","key":"10.1016\/S0167-9260(99)00017-6_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-9260(93)90002-T","article-title":"Path-delay-fault testability properties of multiplexor-based networks","volume":"15","author":"Ashar","year":"1993","journal-title":"INTEGRATION, the VLSI J."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB12","doi-asserted-by":"crossref","unstructured":"L. Lavagno, P. McGeer, A. Saldanha, A.L. Sangiovanni-Vincentelli, Timed shannon circuits: a power-efficient design style and synthesis tool, in Design Automation Conf., 1995, pp. 254\u2013260.","DOI":"10.1109\/DAC.1995.250100"},{"issue":"6","key":"10.1016\/S0167-9260(99)00017-6_BIB13","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1109\/4.509865","article-title":"Top-down pass-transistor logic design","volume":"31","author":"Yano","year":"1996","journal-title":"IEEE J. Solid-State Circ."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB14","doi-asserted-by":"crossref","unstructured":"P. Buch, A. Narayan, A.R. Newton, A.L. Sangiovanni-Vincentelli, Logic synthesis for large pass transistor circuits, in Intl Conf. on CAD, 1997, pp. 663\u2013670.","DOI":"10.1109\/ICCAD.1997.643609"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB15","unstructured":"V. Bertacco, S. Minato, P. Verplaetse, L. Benini, G. De Micheli, Decision diagrams and pass transistor logic synthesis, In Intl Workshop on Logic Synth., 1997."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB16","unstructured":"F. Ferrandi, A. Macii, E. Macii, M. Poncino, R. Scarsi, F. Somenzi, Layout-oriented synthesis of PTL circuits based on BDDs, in Intl Workshop on Logic Synth., 1998, pp. 514\u2013519."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB17","unstructured":"V.V. Le, T. Besson, A. Abbara, D. Brasen, H. Bogushevitsh, G. Saucier, M. Crastes, ASIC prototyping with area oriented mapping for ALTERA\/FLEX devices, in SASIMI, 1995, pp. 176\u2013183."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB18","doi-asserted-by":"crossref","unstructured":"R. Drechsler, A. Sarabi, M. Theobald, B. Becker, M.A. Perkowski, Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagrams, In Design Automation Conf., 1994, pp. 415\u2013419.","DOI":"10.1145\/196244.196444"},{"issue":"10","key":"10.1016\/S0167-9260(99)00017-6_BIB19","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/43.728917","article-title":"Ordered Kronecker functional decision diagrams \u2014 a data structure for representation and manipulation of boolean functions","volume":"17","author":"Drechsler","year":"1998","journal-title":"IEEE Trans. CAD"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB20","unstructured":"B. Bollig, P. Savicky, I. Wegener, On the improvement of variable orderings for OBDDs, IFIP Workshop on Logic and Architecture Synthesis, Grenoble, 1994, pp. 71\u201380."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB21","unstructured":"D.E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning, Addision-Wesley, Reading, MA, 1989."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB22","unstructured":"L. Davis, Handbook of Genetic Algorithms, van Nostrand Reinhold, New York, 1991."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB23","doi-asserted-by":"crossref","unstructured":"T. B\u00e4ck, Evolutionary Algorithms in Theory and Practice, Oxford University Press, Oxford, 1996.","DOI":"10.1093\/oso\/9780195099713.001.0001"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB24","unstructured":"H. Esbensen, A macro-cell global router based on two genetic algorithms, in European Design Automation Conf., 1994, pp. 428\u2013433."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB25","doi-asserted-by":"crossref","unstructured":"E. Rudnick, J.H. Patel, Combining deterministic and genetic approaches for sequential circuit test generation, in Design Automation Conf., 1995, pp. 183\u2013188.","DOI":"10.1109\/DAC.1995.250087"},{"issue":"4","key":"10.1016\/S0167-9260(99)00017-6_BIB26","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1142\/S0218213095000279","article-title":"A genetic algorithm for decomposition type choice in OKFDDs","volume":"4","author":"Drechsler","year":"1995","journal-title":"Int. J. Art. Intell. Tools"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB27","doi-asserted-by":"crossref","unstructured":"R. Drechsler, N. G\u00f6ckel, B. Becker, Learning heuristics for OBDD minimization by evolutionary algorithms, in Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Vol. 1141, 1996, pp. 730\u2013739.","DOI":"10.1007\/3-540-61723-X_1036"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB28","doi-asserted-by":"crossref","unstructured":"F. Corno, P. Prinetto, M. Rebaudengo, M.S. Reorda, Comparing topological, symbolic and GA-based ATPGs: an experimental approach, In Intl Test Conf., 1996, pp. 39\u201347.","DOI":"10.1109\/TEST.1996.556941"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB29","doi-asserted-by":"crossref","unstructured":"N. G\u00f6ckel, R. Drechsler, B. Becker, A multi-layer detailed routing approach based on evolutionary algorithms, In Intl Conf. on Evolutionary Computation, 1997, pp. 557\u2013562.","DOI":"10.1109\/ICEC.1997.592373"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB30","doi-asserted-by":"crossref","unstructured":"R. Drechsler, Evolutionary Algorithms for VLSI CAD, Kluwer Academic Publisher, Dordrecht, 1998.","DOI":"10.1007\/978-1-4757-2866-8"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB31","doi-asserted-by":"crossref","unstructured":"R. Drechsler, B. Becker, Dynamic minimization of OKFDDs, in Intl Conf. on Comp. Design, 1995, pp. 602\u2013607.","DOI":"10.1109\/ICCD.1995.528930"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB32","doi-asserted-by":"crossref","unstructured":"Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin, 1994.","DOI":"10.1007\/978-3-662-07418-3"},{"issue":"1","key":"10.1016\/S0167-9260(99)00017-6_BIB33","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/320954.320957","article-title":"Test routines based on symbolic logical statements","volume":"6","author":"Eldred","year":"1959","journal-title":"J. ACM"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB34","doi-asserted-by":"crossref","unstructured":"M.A. Breuer, A.D. Friedman, Diagnosis & Reliable Design of Digital Systems, Computer Science Press, Rockville, MD, 1976.","DOI":"10.1007\/978-3-642-95424-5"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB35","doi-asserted-by":"crossref","unstructured":"B. Becker, R. Drechsler, Synthesis for testability: circuits derived from ordered Kronecker functional decision diagrams, in European Design & Test Conf. 1995, pp. 592.","DOI":"10.1109\/EDTC.1995.470336"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB36","unstructured":"I. Schaefer, M.A. Perkowski, H. Wu, Multilevel logic synthesis for cellular FPGAs based on orthogonal expansions, IFIP WG 10.5 Workshop on Applications of the Reed\u2013Muller Expansion in Circuit Design, 1993, pp. 42\u201351."},{"issue":"1","key":"10.1016\/S0167-9260(99)00017-6_BIB37","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1008635324476","article-title":"On the expressive power of OKFDDs","volume":"11","author":"Becker","year":"1997","journal-title":"Formal Meth. System Des.: Int. J."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB38","unstructured":"R. Drechsler, B. Becker, Rapid prototyping of fully testable multi-level AND\/EXOR networks, IFIP WG 10.5 Workshop on Applications of the Reed\u2013Muller Expansion in Circuit Design, 1993, pp. 126\u2013133."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB39","doi-asserted-by":"crossref","unstructured":"B. Becker, R. Drechsler, M. Theobald, OKFDDs versus OBDDs and OFDDs, in ICALP, Lecture Notes in Computer Science, Vol. 944, 1995, pp. 475\u2013486.","DOI":"10.1007\/3-540-60084-1_98"},{"key":"10.1016\/S0167-9260(99)00017-6_BIB40","unstructured":"D. Whitley, T. Starkweather, D. Fuquay, Scheduling problems and traveling salesman: The genetic edge recombination operator, in Intl Conf. on Genetic Algorithms, 1989, pp. 133\u2013140."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB41","unstructured":"I.M. Oliver, D.J. Smith, J.R.C. Holland, A study of permutation crossover operators on the traveling salesman problem, in Intl Conf. on Genetic Algorithms, 1987, pp. 224\u2013230."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB42","unstructured":"L. Davis, Applying adaptive algorithms to epistatic domains, in Proc. IJCAI, 1985, pp. 162\u2013164."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB43","unstructured":"S. Yang, Logic synthesis and optimization benchmarks user guide, Technical Report 1\/95, Microelectronic Center of North Carolina, Jan. 1991."},{"key":"10.1016\/S0167-9260(99)00017-6_BIB44","unstructured":"D.E. Goldberg, R. Lingle, Alleles, loci, and the traveling salesman problem, in Intl Conf. on Genetic Algorithms, 1985, pp. 154\u2013159."}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926099000176?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926099000176?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:10:18Z","timestamp":1759137018000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926099000176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0167926099000176"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(99)00017-6","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1999,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"OKFDD minimization by genetic algorithms with application to circuit design","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-9260(99)00017-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}