{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T04:32:07Z","timestamp":1777437127365,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T00:00:00Z","timestamp":1454457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"CONACYT","award":["51623"],"award-info":[{"award-number":["51623"]}]},{"name":"CONACYT","award":["238469"],"award-info":[{"award-number":["238469"]}]},{"name":"CONACYT","award":["232987"],"award-info":[{"award-number":["232987"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s11590-016-1012-x","type":"journal-article","created":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T13:39:00Z","timestamp":1454506740000},"page":"457-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["A two-stage algorithm for combinatorial testing"],"prefix":"10.1007","volume":"11","author":[{"given":"Jose","family":"Torres-Jimenez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Himer","family":"Avila-George","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Idelfonso","family":"Izquierdo-Marquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,3]]},"reference":[{"key":"1012_CR1","first-page":"51","volume":"2013","author":"C Ans\u00f3tegui","year":"2013","unstructured":"Ans\u00f3tegui, C., Izquierdo-Marquez, I., Manya, F., Torres-Jimenez, J.: A Max-SAT-Based approach to constructing optimal covering arrays. Artificial intelligence research and development. CCIA 2013, 51\u201359 (2013)","journal-title":"Artificial intelligence research and development. CCIA"},{"issue":"2","key":"1012_CR2","doi-asserted-by":"crossref","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."},{"key":"1012_CR3","doi-asserted-by":"crossref","unstructured":"Avila-George, H., Torres-Jimenez, J., Hern\u00e1ndez, V., Gonzalez-Hernandez, L.: Simulated annealing for constructing mixed covering arrays. In: Distributed computing and artificial intelligence, pp. 657\u2013664 (2012)","DOI":"10.1007\/978-3-642-28765-7_79"},{"issue":"3","key":"1012_CR4","doi-asserted-by":"crossref","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":"1012_CR5","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1002\/stvr.466","volume":"22","author":"A Calvagna","year":"2012","unstructured":"Calvagna, A., Gargantini, A.: T-wise combinatorial interaction test suites construction based on coverage inheritance. Softw. Test. Verif. Reliab. 22, 507\u2013526 (2012)","journal-title":"Softw. Test. Verif. Reliab."},{"key":"1012_CR6","volume-title":"Experimental design for combinatorial and high throughput materials development","author":"JN Cawse","year":"2003","unstructured":"Cawse, J.N.: Experimental design for combinatorial and high throughput materials development. Wiley, New York (2003)"},{"issue":"4","key":"1012_CR7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/jcd.10002","volume":"10","author":"M Chateauneuf","year":"2002","unstructured":"Chateauneuf, M., Kreher, D.L.: On the state of strength-three covering arrays. J. Comb. Des. 10(4), 217\u2013238 (2002)","journal-title":"J. Comb. Des."},{"issue":"5","key":"1012_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/52.536462","volume":"13","author":"DM Cohen","year":"1996","unstructured":"Cohen, D.M., Dalal, S.R., Parelius, J., Patton, G.C.: The combinatorial design approach to automatic test generation. IEEE Soft. 13(5), 83\u201388 (1996)","journal-title":"IEEE Soft."},{"key":"1012_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Colbourn, C.J., Ling, A.C.H.: Augmenting simulated annealing to build interaction test suites. In: Software reliability engineering, 2003. ISSRE 2003. 14th international symposium on IEEE, pp. 394\u2013405. (2003)","DOI":"10.1109\/ISSRE.2003.1251061"},{"issue":"13","key":"1012_CR10","doi-asserted-by":"crossref","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. Discret. Math. 308(13), 2709\u20132722 (2008). (Combinatorial Designs: A tribute to Jennifer Seberry on her 60th Birthday)","journal-title":"Discret. Math."},{"issue":"2\u20133","key":"1012_CR11","doi-asserted-by":"crossref","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 Cryptogr. 55(2\u20133), 201\u2013219 (2010)","journal-title":"Des. Codes Cryptogr."},{"key":"1012_CR12","unstructured":"Colbourn, C.J. (2015). Covering array tables. http:\/\/www.public.asu.edu\/~ccolbou\/src\/tabby\/3-3-ca.html . Accessed on 11 Mar 2015"},{"issue":"1","key":"1012_CR13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10623-006-0020-8","volume":"41","author":"CJ Colbourn","year":"2006","unstructured":"Colbourn, C.J., Martirosyan, S.S., Trung, T., Walker II, R.A.: Roux-type constructions for covering arrays of strengths three and four. Des. Codes Cryptogr. 41(1), 33\u201357 (2006)","journal-title":"Des. Codes Cryptogr."},{"key":"1012_CR14","doi-asserted-by":"crossref","unstructured":"Duan, F., Lei, Y., Yu, L., Kacker, R.N., Kuhn, D.R.: Improving IPOG\u2019s vertical growth based on a graph coloring scheme. In: 2015 IEEE Eighth international conference on software testing, verification and validation workshops (ICSTW), pp. 1\u20138 (2015)","DOI":"10.1109\/ICSTW.2015.7107444"},{"key":"1012_CR15","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: Design technology of integrated systems in nanoscale era (DTIS), 2015 10th international conference on, pp. 1\u20135 (2015)","DOI":"10.1109\/DTIS.2015.7127362"},{"issue":"5","key":"1012_CR16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.6028\/jres.113.022","volume":"113","author":"M Forbes","year":"2008","unstructured":"Forbes, M., Lawrence, J., Lei, Y., Kacker, R.N., Kuhn, D.R.: Refining the in-parameter-order strategy for constructing covering arrays. J. Res. Natl. Inst. Stand. Technol. 113(5), 287\u2013297 (2008)","journal-title":"J. Res. Natl. Inst. Stand. Technol."},{"key":"1012_CR17","doi-asserted-by":"crossref","unstructured":"Hartman, A.: Software and hardware testing using combinatorial covering suites. In: Graph theory, combinatorics and algorithms, vol. 34 of operations research\/computer science interfaces series, pp. 237\u2013266 (2005)","DOI":"10.1007\/0-387-25036-0_10"},{"key":"1012_CR18","doi-asserted-by":"crossref","unstructured":"Kitsos, P., Simos, D.E., Torres-Jimenez, J., Voyiatzis, A.G.: Exciting FPGA cryptographic trojans using combinatorial testing. In: The 26th IEEE international symposium on software reliability engineering (2015) (To appear)","DOI":"10.1109\/ISSRE.2015.7381800"},{"key":"1012_CR19","doi-asserted-by":"crossref","unstructured":"Kuhn, D.R., Kacker, R.N., Lei, Y.: Practical combinatorial testing. Technical report, National Institute of Standards and Technology (2010)","DOI":"10.6028\/NIST.SP.800-142"},{"key":"1012_CR20","first-page":"61","volume":"49","author":"J Martinez-Pena","year":"2010","unstructured":"Martinez-Pena, J., Torres-Jimenez, J.: A branch and bound algorithm for ternary covering arrays construction using trinomial coefficients. Res. Comput. Sci. 49, 61\u201371 (2010)","journal-title":"Res. Comput. Sci."},{"issue":"1","key":"1012_CR21","doi-asserted-by":"crossref","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. Des. 13(1), 70\u201377 (2005)","journal-title":"J. Comb. Des."},{"issue":"4","key":"1012_CR22","doi-asserted-by":"crossref","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":"1012_CR23","unstructured":"Sherwood, G. (2015). On the construction of orthogonal arrays and covering arrays using permutation groups. http:\/\/testcover.com\/pub\/background\/cover.htm . Accessed 20 Mar 2015"},{"key":"1012_CR24","doi-asserted-by":"crossref","unstructured":"Shiba, T., Tsuchiya, T., Kikuno, T.: Using artificial life techniques to generate test cases for combinatorial testing. In: Proceedings of the 28th annual international computer software and applications Conference, IEEE Computer Society, pp. 72\u201377 (2004)","DOI":"10.1109\/CMPSAC.2004.1342808"},{"issue":"1","key":"1012_CR25","doi-asserted-by":"crossref","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. Des. 1(1), 51\u201363 (1993)","journal-title":"J. Comb. Des."},{"key":"1012_CR26","doi-asserted-by":"crossref","unstructured":"Torres-Jimenez, J., Avila-George, H., Rangel-Valdez, N., Gonzalez-Hernandez, L.: Construction of orthogonal arrays of index unity using logarithm tables for galois fields, chapter 4. InTech, pp. 71\u201390 (2012)","DOI":"10.5772\/35326"},{"issue":"1","key":"1012_CR27","doi-asserted-by":"crossref","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":"1012_CR28","doi-asserted-by":"crossref","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. Plan. Inference 139(1), 69\u201380 (2009)","journal-title":"J. Stat. Plan. Inference"},{"issue":"3","key":"1012_CR29","doi-asserted-by":"crossref","first-page":"388","DOI":"10.7763\/IJCTE.2011.V3.337","volume":"3","author":"MI Younis","year":"2011","unstructured":"Younis, M.I., Zamli, K.Z.: MIPOG - An Efficient t-Way Minimization Strategy for Combinatorial Testing. Int. J. Comput. Theory Eng. 3(3), 388\u2013397 (2011)","journal-title":"Int. J. Comput. Theory Eng."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1012-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1012-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1012-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1012-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T08:56:43Z","timestamp":1748768203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1012-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,3]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1012"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1012-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,3]]}}}