{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T21:53:28Z","timestamp":1718920408484},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2018,1,13]],"date-time":"2018-01-13T00:00:00Z","timestamp":1515801600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472143 and 61673403"],"award-info":[{"award-number":["61472143 and 61673403"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10489-017-1118-6","type":"journal-article","created":{"date-parts":[[2018,1,13]],"date-time":"2018-01-13T04:51:14Z","timestamp":1515819074000},"page":"2894-2911","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A local search based restart evolutionary algorithm for finding triple product property triples"],"prefix":"10.1007","volume":"48","author":[{"given":"Yi","family":"Xiang","sequence":"first","affiliation":[]},{"given":"Yuren","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Zefeng","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,13]]},"reference":[{"key":"1118_CR1","doi-asserted-by":"crossref","unstructured":"Ambainis A, Filmus Y, Gall FL (2015) Fast matrix multiplication: limitations of the Coppersmith-Winograd method. In: Forty-seventh ACM symposium on theory of computing, pp 585\u2013593","DOI":"10.1145\/2746539.2746554"},{"key":"1118_CR2","doi-asserted-by":"crossref","unstructured":"Auger A, Hansen N (2005) A restart cma evolution strategy with increasing population size. In: Proceedings of IEEE congress on evolutionary computation, vol 2, pp 1769\u20131776","DOI":"10.1109\/CEC.2005.1554902"},{"issue":"5","key":"1118_CR3","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/0020-0190(79)90113-3","volume":"8","author":"D Bini","year":"1979","unstructured":"Bini D, Capovani M, Romani F, Lotti G (1979) O(n 2.7799) complexity for n \u00d7 n approximate matrix multiplication. Inf Process Lett 8(5):234\u2013235","journal-title":"Inf Process Lett"},{"key":"1118_CR4","doi-asserted-by":"crossref","unstructured":"Cohn H, Umans C (2003) A group-theoretic approach to fast matrix multiplication. In: 44th annual IEEE symposium on foundations of computer science, 2003. Proceedings, pp 438\u2013449","DOI":"10.1109\/SFCS.2003.1238217"},{"issue":"3","key":"1118_CR5","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1137\/0211038","volume":"11","author":"D Coppersmith","year":"1982","unstructured":"Coppersmith D, Winograd S (1982) On the asymptotic complexity of matrix multiplication. SIAM J Comput 11(3):472\u2013492","journal-title":"SIAM J Comput"},{"issue":"3","key":"1118_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith D, Winograd S (1990) Matrix multiplication via arithmetic progressions. J Symb Comput 9 (3):251\u2013280","journal-title":"J Symb Comput"},{"key":"1118_CR7","unstructured":"Dorigo M (1992) Optimization, learning and natural algorithms (in Italian). Ph.D. thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy"},{"issue":"1","key":"1118_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1515\/gcc-2015-0001","volume":"7","author":"S Hart","year":"2015","unstructured":"Hart S, Hedtke I, M\u00fcller-Hannemann M, Murthy S (2015) A fast search algorithm for \u2329m, m, m\u232a triple product property triples and an application for 5 \u00d7 5 matrix multiplication. Groups Complexity Cryptology 7(1):31\u201346","journal-title":"Groups Complexity Cryptology"},{"issue":"1","key":"1118_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1515\/gcc-2012-0006","volume":"4","author":"I Hedtke","year":"2012","unstructured":"Hedtke I, Murthy S (2012) Search and test algorithms for triple product property triples. Groups-Complexity-Cryptology 4(1):111\u2013133","journal-title":"Groups-Complexity-Cryptology"},{"key":"1118_CR10","unstructured":"Hu H (2015) Search algorithm for the problem of matrix multiplication based on group theory. Master\u2019s thesis, South China University of Technology"},{"issue":"3","key":"1118_CR11","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H Ishibuchi","year":"1998","unstructured":"Ishibuchi H, Murata T (1998) A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Syst Man Cybern Part C Appl Rev 28(3):392\u2013403","journal-title":"IEEE Trans Syst Man Cybern Part C Appl Rev"},{"key":"1118_CR12","doi-asserted-by":"crossref","unstructured":"Jansen T (2002) On the analysis of dynamic restart strategies for evolutionary algorithms. In: International conference on parallel problem solving from nature, pp 33\u201343","DOI":"10.1007\/3-540-45712-7_4"},{"issue":"1976","key":"1118_CR13","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1090\/S0002-9904-1976-13988-2","volume":"82","author":"JD Laderman","year":"1976","unstructured":"Laderman JD (1976) A noncommutative algorithm for multiplying 3 \u00d7 3 matrices using 23 multiplications. Bull Am Math Soc 82(1976):126\u2013128","journal-title":"Bull Am Math Soc"},{"issue":"23","key":"1118_CR14","doi-asserted-by":"publisher","first-page":"7159","DOI":"10.1007\/s00500-016-2259-y","volume":"21","author":"X Lai","year":"2016","unstructured":"Lai X, Zhou Y, Xiang Y (2016) Ant colony optimization for triple product property triples to fast matrix multiplication. Soft Comput 21(23):7159\u20137171","journal-title":"Soft Comput"},{"key":"1118_CR15","doi-asserted-by":"crossref","unstructured":"Le Gall F (2014) Powers of tensors and fast matrix multiplication. In: Proceedings of the 39th international symposium on symbolic and algebraic computation, ISSAC \u201914. ACM, New York, pp 296\u2013303","DOI":"10.1145\/2608628.2608664"},{"issue":"1","key":"1118_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0041-5553(87)90145-5","volume":"27","author":"O Makarov","year":"1987","unstructured":"Makarov O (1987) A non-commutative algorithm for multiplying 5 \u00d7 5 matrices using one hundred multiplications. USSR Comput Math Math Phys 27(1):205\u2013207","journal-title":"USSR Comput Math Math Phys"},{"issue":"14","key":"1118_CR17","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1112\/S1461157010000288","volume":"14","author":"PM Neumann","year":"2011","unstructured":"Neumann PM (2011) A note on the triple product property for subsets of finite groups. LMS J Comput Math 14(14):232\u2013237","journal-title":"LMS J Comput Math"},{"key":"1118_CR18","doi-asserted-by":"crossref","unstructured":"Pan VY (1978) Strassen\u2019s algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations. In: Symposium on foundations of computer science, pp 166\u2013176","DOI":"10.1109\/SFCS.1978.34"},{"issue":"2","key":"1118_CR19","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1137\/0209027","volume":"9","author":"VY Pan","year":"1980","unstructured":"Pan VY (1980) New fast algorithms for matrix operations. SIAM J Comput 9(2):321\u2013342","journal-title":"SIAM J Comput"},{"key":"1118_CR20","doi-asserted-by":"crossref","unstructured":"Polakova R, Tvrdik J, Bujok P (2014) Controlled restart in differential evolution applied to cec2014 benchmark functions. In: Evolutionary computation, pp 2230\u20132236","DOI":"10.1109\/CEC.2014.6900632"},{"key":"1118_CR21","unstructured":"Selman B, Kautz HA, Cohen B (1994) Noise strategies for improving local search. In: Proceedings of the twelfth national conference on artificial intelligence, AAAI\u201994, vol 1. American Association for Artificial Intelligence, Menlo Park, CA, USA, pp 337\u2013343. http:\/\/dl.acm.org\/citation.cfm?id=199288.178090"},{"key":"1118_CR22","doi-asserted-by":"crossref","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: International conference on principles and practice of constraint programming, pp 417\u2013431","DOI":"10.1007\/3-540-49481-2_30"},{"key":"1118_CR23","unstructured":"Stothers A (2010) On the complexity of matrix multiplication. Ph.D. Thesis, University of Edinburgh"},{"issue":"4","key":"1118_CR24","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen V (1969) Gaussian elimination is not optimal. Numer Math 13(4):354\u2013356. https:\/\/doi.org\/10.1007\/BF02165411","journal-title":"Numer Math"},{"issue":"375-376","key":"1118_CR25","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1515\/crll.1987.375-376.406","volume":"1987","author":"V Strassen","year":"1987","unstructured":"Strassen V (1987) Relative bilinear complexity and matrix multiplication. Journal F\u00fcr Die Reine Und Angewandte Mathematik 1987(375-376):406\u2013443","journal-title":"Journal F\u00fcr Die Reine Und Angewandte Mathematik"},{"key":"1118_CR26","doi-asserted-by":"publisher","unstructured":"Stutzle T, Hoos H (1997) Max-min ant system and local search for the traveling salesman problem. In: IEEE international conference on evolutionary computation, pp 309\u2013314. https:\/\/doi.org\/10.1109\/ICEC.1997.592327","DOI":"10.1109\/ICEC.1997.592327"},{"issue":"1","key":"1118_CR27","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1162\/EVCO_a_00068","volume":"21","author":"J Sun","year":"2014","unstructured":"Sun J, Garibaldi JM, Krasnogor N, Zhang Q (2014) An intelligent multi-restart memetic algorithm for box constrained global optimisation. Evol Comput 21(1):107\u2013147","journal-title":"Evol Comput"},{"issue":"03","key":"1118_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218213016500093","volume":"25","author":"L Tang","year":"2016","unstructured":"Tang L, Zhou Y, Xiang Y, Lai X (2016) A multi-objective artificial bee colony algorithm combined with a local search method. Int J Artif Intell Tools 25(03):1\u201330. https:\/\/doi.org\/10.1142\/S0218213016500093","journal-title":"Int J Artif Intell Tools"},{"key":"1118_CR29","doi-asserted-by":"crossref","unstructured":"Williams VV (2012) Multiplying matrices faster than Coppersmith-Winograd. In: Forty-fourth ACM symposium on theory of computing, pp 887\u2013898","DOI":"10.1145\/2213977.2214056"},{"issue":"4","key":"1118_CR30","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0024-3795(71)90009-7","volume":"4","author":"S Winograd","year":"1971","unstructured":"Winograd S (1971) On multiplication of 2 \u00d7 2 matrices. Linear Algebra Appl 4(4):381\u2013388","journal-title":"Linear Algebra Appl"},{"key":"1118_CR31","doi-asserted-by":"crossref","unstructured":"Xing H, Xu L, Qu R, Qu Z (2016) A quantum inspired evolutionary algorithm for dynamic multicast routing with network coding. In: International symposium on communications and information technologies, pp 186\u2013190","DOI":"10.1109\/ISCIT.2016.7751618"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-017-1118-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-1118-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-1118-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T09:45:38Z","timestamp":1570614338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-017-1118-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,13]]},"references-count":31,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1118"],"URL":"https:\/\/doi.org\/10.1007\/s10489-017-1118-6","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,13]]},"assertion":[{"value":"13 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}