{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:45:22Z","timestamp":1752461122065},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2010,11,18]],"date-time":"2010-11-18T00:00:00Z","timestamp":1290038400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10732-010-9150-2","type":"journal-article","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T13:33:45Z","timestamp":1290000825000},"page":"659-674","source":"Crossref","is-referenced-by-count":5,"title":["A tabu search algorithm for the covering design problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Kamal","family":"Fadlaoui","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Galinier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,18]]},"reference":[{"key":"9150_CR1","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TIT.1981.1056392","volume":"27","author":"A.H. Chan","year":"1981","unstructured":"Chan, A.H., Game, R.A.: (n,k,t)-Covering systems and error-trapping decoding. IEEE Trans. Inf. Theory 27, 643\u2013646 (1981)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9150_CR2","volume-title":"Handbook of Combinatorial Designs","year":"2007","unstructured":"Colbourn, C.J., Dinitz, D.H. (eds.): Handbook of Combinatorial Designs, 2nd edn. Chapman and Hall\/CRC Press, Boca Raton (2007)","edition":"2"},{"issue":"3","key":"9150_CR3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.dam.2003.11.006","volume":"144","author":"P. Crescenzi","year":"2004","unstructured":"Crescenzi, P., Montecalvo, F., Rossi, G.: Optimal covering designs: complexity results and new bounds. Discrete Appl. Math. 144(3), 281\u2013290 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9150_CR4","doi-asserted-by":"crossref","unstructured":"Dai, C., Li, P.C., Toulouse, M.: A cooperative multilevel tabu search algorithm for the covering design problem. Artif. Evolution 119\u2013130 (2005)","DOI":"10.1007\/11740698_11"},{"key":"9150_CR5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01388385","volume":"5","author":"T. Etzion","year":"1995","unstructured":"Etzion, T., Wei, V., Zhang, Z.: Bounds on the sizes of constant weight covering codes. Des. Codes Cryptogr. 5, 217\u2013239 (1995)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"9150_CR6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/B:JMMA.0000026709.24659.da","volume":"3","author":"P. Galinier","year":"2004","unstructured":"Galinier, P., Hao, J.-K.: A general approach for constraint solving by local search. J. Math. Model. Algorithms 3(1), 73\u201388 (2004)","journal-title":"J. Math. Model. Algorithms"},{"key":"9150_CR7","unstructured":"Fadlaoui, K., Galinier, P.: Covering designs constructed by using the TS-CD algorithm. Technical Report EPM-RT-2010-01, Ecole Polytechnique de Montr\u00e9al (2010)"},{"key":"9150_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Boston (1997)"},{"key":"9150_CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/jcd.3180030404","volume":"3","author":"D.M. Gordon","year":"1995","unstructured":"Gordon, D.M., Kuperberg, G., Patashnik, O.: New constructions for covering designs. J. Combin. Des. 3, 269\u2013284 (1995)","journal-title":"J. Combin. Des."},{"key":"9150_CR10","unstructured":"Gordon, D.M.: La Jolla covering repository tables. http:\/\/www.ccrwest.org\/cover.html"},{"issue":"1","key":"9150_CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/309739.309744","volume":"30","author":"D.L. Kreher","year":"1999","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial algorithms: generation, enumeration, and search. SIGACT News 30(1), 33\u201335 (1999)","journal-title":"SIGACT News"},{"key":"9150_CR12","first-page":"45","volume":"58","author":"P.C. Li","year":"2000","unstructured":"Li, P.C., van Rees, G.H.J.: New constructions for lotto designs. Utilitas Math. 58, 45\u201364 (2000)","journal-title":"Utilitas Math."},{"key":"9150_CR13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10107-002-0316-z","volume":"94","author":"F. Margot","year":"2003","unstructured":"Margot, F.: Small covering designs by branch-and-cut. Math. Program. 94, 207\u2013220 (2003)","journal-title":"Math. Program."},{"key":"9150_CR14","first-page":"371","volume-title":"Contemporary Design Theory","author":"W.H. Mills","year":"1992","unstructured":"Mills, W.H., Mullin, R.C.: Coverings and packings. In: Dinitz, J.H., Stinson, D.R. (eds.) Contemporary Design Theory, pp. 371\u2013399 (1992)"},{"key":"9150_CR15","first-page":"93","volume":"96","author":"K.J. Nurmela","year":"1993","unstructured":"Nurmela, K.J., \u00d6sterg\u00e5rd, P.R.J.: Upper bounds for covering designs by simulated annealing. Congr. Numer. 96, 93\u2013111 (1993)","journal-title":"Congr. Numer."},{"key":"9150_CR16","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.2140\/pjm.1964.14.1405","volume":"14","author":"J. Sch\u00f6nheim","year":"1964","unstructured":"Sch\u00f6nheim, J.: On coverings. Pac. J. Math. 14, 1405\u20131411 (1964)","journal-title":"Pac. J. Math."},{"key":"9150_CR17","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02125454","volume":"63","author":"P. Soriano","year":"1996","unstructured":"Soriano, P., Gendreau, M.: Diversification strategies in tabu search algorithms for the maximum clique problem. Ann. Oper. Res. 63, 189\u2013207 (1996)","journal-title":"Ann. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9150-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-010-9150-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9150-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T06:08:35Z","timestamp":1559801315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9150-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,18]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["9150"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9150-2","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,18]]}}}