{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:07:29Z","timestamp":1758823649796},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169519"},{"type":"electronic","value":"9783642169526"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16952-6_58","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T09:52:47Z","timestamp":1288691567000},"page":"572-581","source":"Crossref","is-referenced-by-count":9,"title":["A Heuristic Approach for Constructing Ternary Covering Arrays Using Trinomial Coefficients"],"prefix":"10.1007","author":[{"given":"Jorge","family":"Martinez-Pena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Torres-Jimenez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nelson","family":"Rangel-Valdez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Himer","family":"Avila-George","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"58_CR1","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. In: Graph Theory, Combinatorics and Algorithms. Operations Research\/Computer Science Interfaces Series, vol.\u00a034, pp. 237\u2013266. Springer US, Heidelberg (2005)"},{"key":"58_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jcd.3180010106","volume":"1","author":"N. Sloane","year":"1993","unstructured":"Sloane, N.: Covering arrays and intersecting codes. Journal of Combinatorial Designs\u00a01, 51\u201363 (1993)","journal-title":"Journal of Combinatorial Designs"},{"key":"58_CR3","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.jcta.2009.06.002","volume":"117","author":"L. Ji","year":"2010","unstructured":"Ji, L., Yin, J.: Constructions of new orthogonal arrays and covering arrays of strength three. J. Comb. Theory, Ser. A\u00a0117, 236\u2013247 (2010)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"3","key":"58_CR4","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1214\/aoms\/1177729387","volume":"23","author":"K. Bush","year":"1952","unstructured":"Bush, K.: Orthogonal arrays of index unity. Annals of Mathematical Statistics\u00a023(3), 426\u2013434 (1952)","journal-title":"Annals of Mathematical Statistics"},{"key":"58_CR5","unstructured":"Lei, Y., Tai, K.C.: In-parameter-order: A test generation strategy for pairwise testing. In: HASE, pp. 254\u2013261 (1998)"},{"key":"58_CR6","unstructured":"Stardom, J.: Metaheuristics and the search for covering and packing arrays. Master\u2019s thesis, Simon Fraser University (2001)"},{"key":"58_CR7","doi-asserted-by":"publisher","DOI":"10.1201\/9781420049954","volume-title":"The CRC Handbook of Combinatorial Designs","author":"C. Colbourn","year":"1996","unstructured":"Colbourn, C., Dinitz, J.: The CRC Handbook of Combinatorial Designs. CRC press, Boca Raton (1996)"},{"key":"58_CR8","unstructured":"Nurmela, K.J., \u00d6sterg\u00e5rd, P.R.J.: Constructing covering designs by simulated annealing. Technical Report B10, Helsinki University of Technology, Digital Systems Labora tory, Espoo, Finland (1993)"},{"key":"58_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0166-218X(03)00291-9","volume":"138","author":"K.J. Nurmela","year":"2004","unstructured":"Nurmela, K.J.: Upper bounds for covering arrays by tabu search. Discrete Appl. Math.\u00a0138, 143\u2013152 (2004)","journal-title":"Discrete Appl. Math."},{"key":"58_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/B:DESI.0000029232.40302.6d","volume":"32","author":"S. Martirosyan","year":"2004","unstructured":"Martirosyan, S., van Trung, T.: On t-covering arrays. Des. Codes Cryptography\u00a032, 323\u2013339 (2004)","journal-title":"Des. Codes Cryptography"},{"key":"58_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.disc.2003.11.029","volume":"284","author":"A. Hartman","year":"2004","unstructured":"Hartman, A., Raskin, L.: Problems and algorithms for covering arrays. Discrete Mathematics\u00a0284, 149\u2013156 (2004)","journal-title":"Discrete Mathematics"},{"key":"58_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.6028\/jres.113.022","volume":"213","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. Journal of Research of the National Institute of Standards and Technology\u00a0213, 287\u2013297 (2008)","journal-title":"Journal of Research of the National Institute of Standards and Technology"},{"key":"58_CR13","doi-asserted-by":"publisher","first-page":"210","DOI":"10.2307\/2688543","volume":"42","author":"R. Keeney","year":"1969","unstructured":"Keeney, R.: On the trinomial coefficients. Mathematics Magazine\u00a042, 210\u2013212 (1969)","journal-title":"Mathematics Magazine"},{"key":"58_CR14","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley Longman Publishing Co., Inc., Boston (1994)"},{"key":"58_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence \u2013 IBERAMIA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16952-6_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T21:01:57Z","timestamp":1553202117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16952-6_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169519","9783642169526"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16952-6_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}