{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:16:40Z","timestamp":1726514200329},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,8,6]],"date-time":"2015-08-06T00:00:00Z","timestamp":1438819200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s11590-015-0927-y","type":"journal-article","created":{"date-parts":[[2015,8,5]],"date-time":"2015-08-05T20:26:12Z","timestamp":1438806372000},"page":"1303-1314","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics"],"prefix":"10.1007","volume":"10","author":[{"given":"D.","family":"Souravlias","sequence":"first","affiliation":[]},{"given":"K. E.","family":"Parsopoulos","sequence":"additional","affiliation":[]},{"given":"I. S.","family":"Kotsireas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,6]]},"reference":[{"key":"927_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/0471739383","volume-title":"Parallel Metaheuristics: A New Class of Algorithms","author":"E Alba","year":"2005","unstructured":"Alba, E.: Parallel Metaheuristics: A New Class of Algorithms. Wiley, London (2005)"},{"key":"927_CR2","doi-asserted-by":"crossref","first-page":"2802","DOI":"10.1016\/j.disc.2004.12.029","volume":"308","author":"M Ang","year":"2008","unstructured":"Ang, M., Arasu, K., Ma, S., Strassler, Y.: Study of proper circulant weighing matrices with weigh 9. Discrete Math. 308, 2802\u20132809 (2008)","journal-title":"Discrete Math."},{"key":"927_CR3","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/0097-3165(95)90006-3","volume":"71","author":"K Arasu","year":"1995","unstructured":"Arasu, K., Dillon, J., Jungnickel, D., Pott, A.: The solution of the waterloo problem. J. Comb. Theory Ser. A 71, 316\u2013331 (1995)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"5","key":"927_CR4","doi-asserted-by":"crossref","first-page":"2051","DOI":"10.1109\/18.930940","volume":"47","author":"K Arasu","year":"2001","unstructured":"Arasu, K., Gulliver, T.: Self-dual codes over fp and weighing matrices. IEEE Trans. Inf. Theory 47(5), 2051\u20132055 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"927_CR5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s12095-010-0025-z","volume":"2","author":"K Arasu","year":"2010","unstructured":"Arasu, K., Gutman, A.: Circulant weighing matrices. Cryptogr. Commun. 2, 155\u2013171 (2010)","journal-title":"Cryptogr. Commun."},{"key":"927_CR6","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.ffa.2005.06.009","volume":"12","author":"K Arasu","year":"2006","unstructured":"Arasu, K., Leung, K., Ma, S., Nabavi, A., Ray-Chaudhuri, D.: Determination of all possible orders of weight 16 circulant weighing matrices. Finite Fields Appl. 12, 498\u2013538 (2006)","journal-title":"Finite Fields Appl."},{"issue":"1\u20133","key":"927_CR7","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.tcs.2008.06.002","volume":"407","author":"M Chiarandini","year":"2008","unstructured":"Chiarandini, M., Kotsireas, I., Koukouvinos, C., Paquete, L.: Heuristic algorithms for hadamard matrices with two circulant cores. Theor. Comput. Sci. 407(1\u20133), 274\u2013277 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"927_CR8","first-page":"263","volume":"35","author":"J Cousineau","year":"2006","unstructured":"Cousineau, J., Kotsireas, I., Koukouvinos, C.: Genetic algorithms for orthogonal designs. Australas. J. Comb. 35, 263\u2013272 (2006)","journal-title":"Australas. J. Comb."},{"key":"927_CR9","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s00453-002-0975-4","volume":"34","author":"W Dam van","year":"2002","unstructured":"van Dam, W.: Quantum algorithms for weighing matrices and quadratic residues. Algorithmica 34, 413\u2013428 (2002)","journal-title":"Algorithmica"},{"key":"927_CR10","unstructured":"Eades, P.: On the existence of orthogonal designs. Ph.D. thesis, Australian National University, Canberra (1997)"},{"key":"927_CR11","first-page":"265","volume":"2","author":"P Eades","year":"1976","unstructured":"Eades, P., Hain, R.: On circulant weighing matrices. Ars Comb. 2, 265\u2013284 (1976)","journal-title":"Ars Comb."},{"key":"927_CR12","doi-asserted-by":"crossref","unstructured":"Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings Sixth Symposium on Micro Machine and Human Science, pp. 39\u201343. Piscataway, NJ (1995)","DOI":"10.1109\/MHS.1995.494215"},{"key":"927_CR13","unstructured":"Geramita, A., Sebery, J.: Orthogonical designs: quadratic forms and hadamard matrices. Lecture Notes in Pure and Applied Mathematics (1979)"},{"issue":"5","key":"927_CR14","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"key":"927_CR15","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolio design: theory vs. practice. In: Proceedings Thirteenth conference on Uncertainty in artificial intelligence, pp. 190\u2013197 (1997)"},{"key":"927_CR16","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., Moreno P\u00e9rez, J.A.: Variable neighborhood search. In: M. Gendreau, J.Y. Potvin (eds.) Handbook of Metaheuristics, vol. 146, chap. 3. Springer, Berlin (2010)","DOI":"10.1007\/978-1-4419-1665-5_3"},{"key":"927_CR17","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"27","author":"BA Huberman","year":"1997","unstructured":"Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 27, 51\u201353 (1997)","journal-title":"Science"},{"key":"927_CR18","doi-asserted-by":"crossref","unstructured":"Kotsireas, I.: Algorithms and metaheuristics for combinatorial matrices. In: P. Pardalos, D.Z. Du, R.L. Graham (eds.) Handbook of Combinatorial Optimization, pp. 283\u2013309. Springer, New York (2013)","DOI":"10.1007\/978-1-4419-7997-1_13"},{"issue":"1","key":"927_CR19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10878-008-9194-5","volume":"20","author":"I Kotsireas","year":"2010","unstructured":"Kotsireas, I., Koukouvinos, C., Pardalos, P., Shylo, O.: Periodic complementary binary sequences and combinatorial optimization algorithms. J. Combin. Optim. 20(1), 63\u201375 (2010)","journal-title":"J. Combin. Optim."},{"issue":"4","key":"927_CR20","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1007\/s10878-011-9404-4","volume":"24","author":"I Kotsireas","year":"2012","unstructured":"Kotsireas, I., Koukouvinos, C., Pardalos, P., Simos, D.: Competent genetic algorithms for weighing matrices. J. Combin. Optim. 24(4), 508\u2013525 (2012)","journal-title":"J. Combin. Optim."},{"key":"927_CR21","doi-asserted-by":"crossref","unstructured":"Kotsireas, I., Parsopoulos, K., Piperagkas, G., Vrahatis, M.: Ant-based approaches for solving autocorrelation problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7461 LNCS, pp. 220\u2013227 (2012)","DOI":"10.1007\/978-3-642-32650-9_21"},{"issue":"1","key":"927_CR22","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0378-3758(96)00172-3","volume":"62","author":"C Koukouvinos","year":"1997","unstructured":"Koukouvinos, C., Seberry, J.: Weighing matrices and their applications. J. Stat. Plan. Inference 62(1), 91\u2013101 (1997)","journal-title":"J. Stat. Plan. Inference"},{"issue":"11","key":"927_CR23","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"927_CR24","doi-asserted-by":"crossref","unstructured":"Parsopoulos, K.E., Vrahatis, M.N.: Particle Swarm Optimization and Intelligence: Advances and Applications. Information Science Publishing (IGI Global), Hershey, USA (2010)","DOI":"10.4018\/978-1-61520-666-7"},{"issue":"5","key":"927_CR25","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TEVC.2010.2040183","volume":"14","author":"F Peng","year":"2010","unstructured":"Peng, F., Tang, K., Chen, G., Yao, X.: Population-based algorithm portfolios for numerical optimization. IEEE Trans. Evol. Comput. 14(5), 782\u2013800 (2010)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"927_CR26","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10732-011-9167-1","volume":"18","author":"C Ribeiro","year":"2012","unstructured":"Ribeiro, C., Resende, M.: Path-relinking intensification methods for stochastic local search algorithms. J. Heuristics 18(2), 193\u2013214 (2012)","journal-title":"J. Heuristics"},{"issue":"1","key":"927_CR27","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/j.jcta.2012.08.004","volume":"120","author":"B Schmidt","year":"2013","unstructured":"Schmidt, B., Smith, K.W.: Circulant weighing matrices whose order and weight are products of powers of 2 and 3. J. Comb. Theory Ser. A 120(1), 275\u2013287 (2013)","journal-title":"J. Comb. Theory Ser. A"},{"key":"927_CR28","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1017\/S0004972700024096","volume":"12","author":"J Seberry","year":"1975","unstructured":"Seberry, J., Whiteman, A.: Some results on weighing matrices. Bull. Aust. Math. Soc. 12, 433\u2013447 (1975)","journal-title":"Bull. Aust. Math. Soc."},{"key":"927_CR29","unstructured":"Souravlias, D., Parsopoulos, K.E., Alba, E.: Parallel algorithm portfolio with market trading-based time allocation. In: Proceedings International Conference on Operations Research 2014 (OR2014) (2014)"},{"issue":"4","key":"927_CR30","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Glob. Optim."},{"key":"927_CR31","unstructured":"Strassler, Y.: The classification of circulant weighing matrices of weight 9. Ph.D. thesis, Bar-Ilan University (1997)"},{"key":"927_CR32","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.ins.2014.03.105","volume":"279","author":"K Tang","year":"2014","unstructured":"Tang, K., Peng, F., Chen, G., Yao, X.: Population-based algorithm portfolios with automated constituent algorithms selection. Inf. Sci. 279, 94\u2013104 (2014)","journal-title":"Inf. Sci."},{"key":"927_CR33","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-540-92151-6_5","volume":"175","author":"F Tasgetiren","year":"2009","unstructured":"Tasgetiren, F., Chen, A., Gencyilmaz, G., Gattoufi, S.: Smallest position value approach. Stud. Comput. Intel. 175, 121\u2013138 (2009)","journal-title":"Stud. Comput. Intel."},{"key":"927_CR34","first-page":"672","volume":"2014","author":"I Yevseyeva","year":"2014","unstructured":"Yevseyeva, I., Guerreiro, A.P., Emmerich, M.T.M., Fonseca, C.M.: A portfolio optimization approach to selection in multiobjective evolutionary algorithms. Proc. PPSN 2014, 672\u2013681 (2014)","journal-title":"Proc. PPSN"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0927-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0927-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0927-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T02:54:55Z","timestamp":1567047295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0927-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,6]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["927"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0927-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,6]]}}}