{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T03:12:38Z","timestamp":1782875558685,"version":"3.54.5"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319270593","type":"print"},{"value":"9783319270609","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27060-9_13","type":"book-chapter","created":{"date-parts":[[2015,11,19]],"date-time":"2015-11-19T15:14:30Z","timestamp":1447946070000},"page":"158-177","source":"Crossref","is-referenced-by-count":4,"title":["A Branch &amp; Bound Algorithm to Derive a Direct Construction for Binary Covering Arrays"],"prefix":"10.1007","author":[{"given":"Jose","family":"Torres-Jimenez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Idelfonso","family":"Izquierdo-Marquez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aldo","family":"Gonzalez-Gomez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Himer","family":"Avila-George","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1049\/iet-sen.2012.0074","volume":"7","author":"H Avila-George","year":"2013","unstructured":"Avila-George, H., Torres-Jimenez, J., Gonzalez-Hernandez, L., Hern\u00e1ndez, V.: Metaheuristic approach for constructing functional test-suites. IET Softw. 7(2), 104\u2013117 (2013)","journal-title":"IET Softw."},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1214\/aoms\/1177729387","volume":"23","author":"KA Bush","year":"1952","unstructured":"Bush, K.A.: Orthogonal arrays of index unity. Ann. Math. Stat. 23(3), 426\u2013434 (1952)","journal-title":"Ann. Math. Stat."},{"key":"13_CR3","unstructured":"Cawse, J.N.: Experimental Design for Combinatorial and High Throughput Materials Development. John Wiley & Sons, Hoboken (2003)"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1008379710317","volume":"16","author":"M Chateauneuf","year":"1999","unstructured":"Chateauneuf, M., Colbourn, C.J., Kreher, D.: Covering arrays of strength three. Des. Codes Crypt. 16(3), 235\u2013242 (1999)","journal-title":"Des. Codes Crypt."},{"issue":"13","key":"13_CR5","doi-asserted-by":"publisher","first-page":"2709","DOI":"10.1016\/j.disc.2006.06.036","volume":"308","author":"MB Cohen","year":"2008","unstructured":"Cohen, M.B., Colbourn, C.J., Ling, A.C.H.: Constructing strength three covering arrays with augmented annealing. Discrete Math. 308(13), 2709\u20132722 (2008)","journal-title":"Discrete Math."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10623-009-9333-8","volume":"55","author":"CJ Colbourn","year":"2010","unstructured":"Colbourn, C.J.: Covering arrays from cyclotomy. Des. Codes Crypt. 55, 201\u2013219 (2010)","journal-title":"Des. Codes Crypt."},{"key":"13_CR7","unstructured":"Colbourn, C.J., Cohen, M.B.: A deterministic density algorithm for pairwise interaction coverage. In: Proceedings of the IASTED - International Conference on Software Engineering, pp. 345\u2013352 (2004)"},{"issue":"11","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1158","DOI":"10.1016\/j.dam.2010.03.008","volume":"158","author":"CJ Colbourn","year":"2010","unstructured":"Colbourn, C.J., K\u00e9ri, G., Rivas Soriano, P.P., Schlage-Puchta, J.C.: Covering and radius-covering arrays: constructions and classification. Discrete Appl. Math. 158(11), 1158\u20131180 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1002\/jcd.20065","volume":"14","author":"CJ Colbourn","year":"2006","unstructured":"Colbourn, C.J., Martirosyan, S.S., Mullen, G.L., Shasha, D., Sherwood, G.B., Yucas, J.L.: Products of mixed covering arrays of strength two. Comb. Designs 14(2), 124\u2013138 (2006)","journal-title":"Comb. Designs"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Flottes, M.L., Dupuis, S., Ba, P.S., Rouzeyre, B.: On the limitations of logic testing for detecting hardware Trojans horses. In: 2015 10th International Conference on Design Technology of Integrated Systems in Nanoscale Era (DTIS), pp. 1\u20135, April 2015","DOI":"10.1109\/DTIS.2015.7127362"},{"key":"13_CR11","unstructured":"Forbes, M., Lawrence, J., Lei, Y., Kacker, R.N., Kuhn, D.R.: Covering arrays generated by IPOG-F (2012). http:\/\/math.nist.gov\/coveringarrays\/ipof\/ipof-results.html"},{"key":"13_CR12","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/0-387-25036-0_10","volume-title":"Graph Theory. Combinatorics and Algorithms","author":"A Hartman","year":"2005","unstructured":"Hartman, A.: Software and hardware testing using combinatorial covering suites. Graph Theory. Combinatorics and Algorithms. Operations Research\/Computer Science Interfaces Series, pp. 237\u2013266. Springer, US (2005)"},{"key":"13_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1478-6","volume-title":"Orthogonal Arrays: Theory and Applications","author":"AS Hedayat","year":"1999","unstructured":"Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays: Theory and Applications. Springer-Verlag, New York (1999)"},{"issue":"1\u20132","key":"13_CR14","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF02018457","volume":"3","author":"GOH Katona","year":"1973","unstructured":"Katona, G.O.H.: Two applications (for search theory and truth functions) of sperner type theorems. Periodica Mathematica Hungarica 3(1\u20132), 19\u201326 (1973)","journal-title":"Periodica Mathematica Hungarica"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Kitsos, P., Dimitris, E.S., Torres-Jimenez, J., Voyiatzis, A.G.: Exciting FPGA cryptographic Trojans using combinatorial testing. In: Proceedings of the 26th IEEE International Symposium on Software Reliability Engineering (accepted 2015)","DOI":"10.1109\/ISSRE.2015.7381800"},{"issue":"3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0012-365X(73)90098-8","volume":"6","author":"DJ Kleitman","year":"1973","unstructured":"Kleitman, D.J., Spencer, J.: Families of k-independent sets. Discrete Math. 6(3), 255\u2013262 (1973)","journal-title":"Discrete Math."},{"issue":"1","key":"13_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/488","volume":"18","author":"J Lawrence","year":"2011","unstructured":"Lawrence, J., Kacker, R.N., Lei, Y., Kuhn, D.R., Forbes, M.: A survey of binary covering arrays. Electron. J. Comb. 18(1), 1\u201330 (2011)","journal-title":"Electron. J. Comb."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Lei, Y., Kacker, R.N., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG: a general strategy for T-way software testing. In: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, pp. 549\u2013556 (2007)","DOI":"10.1109\/ECBS.2007.47"},{"key":"13_CR19","unstructured":"Martinez-Pena, J.: Construction of covering arrays of ternary alphabet and variable strength. Master\u2019s thesis, CINVESTAV-Tamaulipas, Information Technology Laboratory, January 2011"},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1002\/jcd.20035","volume":"13","author":"K Meagher","year":"2005","unstructured":"Meagher, K., Stevens, B.: Group construction of covering arrays. J. Comb. Designs 13(1), 70\u201377 (2005)","journal-title":"J. Comb. Designs"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Mingfu, X., Aiqun, H., Yi, H., Guyue, L.: Monte Carlo based test pattern generation for hardware Trojan detection. In: IEEE 11th International Conference on Dependable, Autonomic and Secure Computing (DASC 2013), pp. 131\u2013136, December 2013","DOI":"10.1109\/DASC.2013.50"},{"issue":"1\u20132","key":"13_CR22","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0166-218X(03)00291-9","volume":"138","author":"KJ Nurmela","year":"2004","unstructured":"Nurmela, K.J.: Upper bounds for covering arrays by tabu search. Discrete Appl. Math. 138(1\u20132), 143\u2013152 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"13_CR23","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1104\/pp.010683","volume":"127","author":"DE Shasha","year":"2001","unstructured":"Shasha, D.E., Kouranov, A.Y., Lejay, L.V., Chou, M.F., Coruzzi, G.M.: Using combinatorial design to study regulation by multiple input signals: a tool for parsimony in the post-genomics era. Plant Physiol. 127(4), 1590\u20131594 (2001)","journal-title":"Plant Physiol."},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Shiba, T., Tsuchiya, T., Kikuno, T.: Using artificial life techniques togenerate test cases for combinatorial testing.In: Proceedings of the 28th Annual International Computer Softwareand Applications Conference, vol. 01, pp. 72\u201377 (2004)","DOI":"10.1109\/CMPSAC.2004.1342808"},{"issue":"1","key":"13_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jcd.3180010106","volume":"1","author":"NJA Sloane","year":"1993","unstructured":"Sloane, N.J.A.: Covering arrays and intersecting codes. J. Comb. Designs 1(1), 51\u201363 (1993)","journal-title":"J. Comb. Designs"},{"key":"13_CR26","unstructured":"Stardom, J.: Metaheuristics and the search for covering and packing arrays. Master\u2019s thesis, Simon Fraser University (2001)"},{"issue":"3","key":"13_CR27","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/(SICI)1520-6610(1999)7:3<185::AID-JCD3>3.0.CO;2-3","volume":"7","author":"B Stevens","year":"1999","unstructured":"Stevens, B., Mendelsohn, E.: New recursive methods for transversal covers. J. Comb. Designs 7(3), 185\u2013203 (1999)","journal-title":"J. Comb. Designs"},{"issue":"2","key":"13_CR28","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1147\/rd.282.0212","volume":"28","author":"DT Tang","year":"1984","unstructured":"Tang, D.T., Chen, C.L.: Iterative exhaustive pattern generation for logic testing. IBM J. Res. Dev. 28(2), 212\u2013219 (1984)","journal-title":"IBM J. Res. Dev."},{"issue":"12","key":"13_CR29","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1109\/TC.1983.1676175","volume":"32","author":"DT Tang","year":"1983","unstructured":"Tang, D.T., Woo, L.S.: Exhaustive test pattern generation with constant weight vectors. IEEE Trans. Comput. 32(12), 1145\u20131150 (1983)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"13_CR30","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.ins.2011.09.020","volume":"185","author":"J Torres-Jimenez","year":"2012","unstructured":"Torres-Jimenez, J., Rodriguez-Tello, E.: New bounds for binary covering arrays using simulated annealing. Inf. Sci. 185(1), 137\u2013152 (2012)","journal-title":"Inf. Sci."},{"issue":"1","key":"13_CR31","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.jspi.2008.05.020","volume":"139","author":"RA Walker II","year":"2009","unstructured":"Walker II, R.A., Colbourn, C.J.: Tabu search for covering arrays using permutation vectors. J. Stat. Plann. Infer. 139(1), 69\u201380 (2009)","journal-title":"J. Stat. Plann. Infer."},{"issue":"2","key":"13_CR32","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.jcta.2003.09.005","volume":"104","author":"J Yin","year":"2003","unstructured":"Yin, J.: Constructions of difference covering arrays. J. Comb. Theor. Ser. A 104(2), 327\u2013339 (2003)","journal-title":"J. Comb. Theor. Ser. A"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence and Soft Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27060-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T13:00:40Z","timestamp":1748696440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27060-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319270593","9783319270609"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27060-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}