{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T23:10:04Z","timestamp":1745190604926,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642346538"},{"type":"electronic","value":"9783642346545"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34654-5_62","type":"book-chapter","created":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T10:33:06Z","timestamp":1352975586000},"page":"611-620","source":"Crossref","is-referenced-by-count":1,"title":["Constructing Real Test-Suites Using an Enhanced Simulated Annealing"],"prefix":"10.1007","author":[{"given":"Himer","family":"Avila-George","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Torres-Jimenez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vicente","family":"Hern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"62_CR1","unstructured":"Arshem, J., Schroeder, P.J.: Test Vector Generator, TVG (2009), http:\/\/sourceforge.net\/projects\/tvg"},{"key":"62_CR2","unstructured":"Avila-George, H., Torres-Jimenez, J., Rangel-Valdez, N., Carri\u00f3n, A., Hern\u00e1ndez, V.: Supercomputing and Grid Computing on the Verification of Covering Arrays. The Journal of Supercomputing, 1\u201330 (2012) (published online: April 18, 2012)"},{"issue":"3","key":"62_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/stvr.365","volume":"17","author":"R.C. Bryce","year":"2007","unstructured":"Bryce, R.C., Colbourn, C.J.: The Density Algorithm for Pairwise Interaction Testing. Software Testing, Verification and Reliability\u00a017(3), 159\u2013182 (2007)","journal-title":"Software Testing, Verification and Reliability"},{"issue":"4","key":"62_CR4","doi-asserted-by":"publisher","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. Journal of Combinatorial Designs\u00a010(4), 217\u2013238 (2002)","journal-title":"Journal of Combinatorial Designs"},{"issue":"5","key":"62_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/52.536462","volume":"13","author":"D.M. Cohen","year":"1996","unstructured":"Cohen, D.M., Dalal, S.R., Parelius, J., Patton, G.C.: The Combinatorial Design Approach to Automatic Test Generation. IEEE Software\u00a013(5), 83\u201388 (1996)","journal-title":"IEEE Software"},{"issue":"13","key":"62_CR6","doi-asserted-by":"publisher","first-page":"2709","DOI":"10.1016\/j.disc.2006.06.036","volume":"308","author":"M.B. Cohen","year":"2008","unstructured":"Cohen, M.B., Colbourn, C.J., Ling, A.C.: Constructing Strength Three Covering Arrays with Augmented Annealing. Discrete Math.\u00a0308(13), 2709\u20132722 (2008)","journal-title":"Discrete Math."},{"key":"62_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Gibbons, P.B., Mugridge, W.B., Colbourn, C.J.: Constructing Test Suites for Interaction Testing. In: 25th Intl. Conf. on Software Engineering (ICSE 2003), pp. 38\u201348. IEEE (2003)","DOI":"10.1109\/ICSE.2003.1201186"},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Gonzalez-Hernandez, L., Torres-Jimenez, J., Rangel-Valdez, N.: Construction of Mixed Covering Arrays of Strengths 2 through 6 Using a Tabu Search Approach. In: Discrete Mathematics, Algorithms and Applications 2 (in press, 2012)","DOI":"10.1142\/S1793830912500334"},{"key":"62_CR9","unstructured":"Jenkins, B.: Jenny \u2013 A Pairwise Testing Tool (2011), http:\/\/burtleburtle.net\/bob\/math\/jenny.html"},{"key":"62_CR10","doi-asserted-by":"crossref","unstructured":"Lei, Y., Kacker, R.N., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG \u2013 A General Strategy for T-Way Software Testing. In: 14th Annual IEEE Intl. Conf. and Works. on the Eng. of Computer-Based Systems (ECBS 2007), pp. 549\u2013556. IEEE (2007)","DOI":"10.1109\/ECBS.2007.47"},{"issue":"5","key":"62_CR11","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.disc.2011.10.026","volume":"312","author":"J.R. Lobb","year":"2012","unstructured":"Lobb, J.R., Colbourn, C.J., Danziger, P., Stevens, B., Torres-Jimenez, J.: Cover Starters for Covering Arrays of Strength Two. Discrete Math.\u00a0312(5), 943\u2013956 (2012)","journal-title":"Discrete Math."},{"key":"62_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-642-16952-6_58","volume-title":"Advances in Artificial Intelligence \u2013 IBERAMIA 2010","author":"J. Martinez-Pena","year":"2010","unstructured":"Martinez-Pena, J., Torres-Jimenez, J., Rangel-Valdez, N., Avila-George, H.: A Heuristic Approach for Constructing Ternary Covering Arrays Using Trinomial Coefficients. In: Kuri-Morales, A., Simari, G.R. (eds.) IBERAMIA 2010. LNCS, vol.\u00a06433, pp. 572\u2013581. Springer, Heidelberg (2010)"},{"issue":"1","key":"62_CR13","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. Journal of Combinatorial Designs\u00a013(1), 70\u201377 (2005)","journal-title":"Journal of Combinatorial Designs"},{"issue":"6","key":"62_CR14","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/jcd.10059","volume":"11","author":"L. Moura","year":"2003","unstructured":"Moura, L., Stardom, J., Stevens, B., Williams, A.W.: Covering Arrays with Mixed Alphabet Sizes. Journal of Combinatorial Designs\u00a011(6), 413\u2013432 (2003)","journal-title":"Journal of Combinatorial Designs"},{"issue":"24","key":"62_CR15","doi-asserted-by":"publisher","first-page":"6022","DOI":"10.1016\/j.disc.2007.11.021","volume":"308","author":"G.B. Sherwood","year":"2008","unstructured":"Sherwood, G.B.: Optimal and Near-Optimal Mixed Covering Arrays by Column Expansion. Discrete Mathematics\u00a0308(24), 6022\u20136035 (2008)","journal-title":"Discrete Mathematics"},{"key":"62_CR16","doi-asserted-by":"crossref","unstructured":"Shiba, T., Tsuchiya, T., Kikuno, T.: Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing. In: 28th Annual Intl. Computer Software and Applications Conf (COMPSAC 2004), pp. 72\u201377. IEEE (2004)","DOI":"10.1109\/CMPSAC.2004.1342808"},{"key":"62_CR17","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. In: Sen, J. (ed.) Cryptography and Security in Computing, pp. 71\u201390. InTech (2012)","DOI":"10.5772\/35326"},{"issue":"1","key":"62_CR18","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. Information Sciences\u00a0185(1), 137\u2013152 (2012)","journal-title":"Information Sciences"},{"key":"62_CR19","unstructured":"Williams, A.W.: Determination of Test Configurations for Pair-Wise Interaction Coverage. In: 13th Intl. Conf. on Testing Communicating Systems \u2013 Tools and Techniques (TestCom 2000), pp. 57\u201372. Kluwer (2000)"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence \u2013 IBERAMIA 2012"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34654-5_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T22:42:27Z","timestamp":1745188947000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-34654-5_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346538","9783642346545"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34654-5_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}