{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:38:54Z","timestamp":1648586334828},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T00:00:00Z","timestamp":1408752000000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10589-014-9688-2","type":"journal-article","created":{"date-parts":[[2014,8,22]],"date-time":"2014-08-22T15:35:08Z","timestamp":1408721708000},"page":"789-814","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Addressing the envelope reduction of sparse matrices using a genetic programming system"],"prefix":"10.1007","volume":"60","author":[{"given":"Behrooz","family":"Koohestani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Poli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,23]]},"reference":[{"key":"9688_CR1","volume-title":"Sparse Matrix Technology","author":"S Pissanetskey","year":"1984","unstructured":"Pissanetskey, S.: Sparse Matrix Technology. Academic Press, London (1984)"},{"key":"9688_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1002\/nme.1620020104","volume":"2","author":"BM Irons","year":"1970","unstructured":"Irons, B.M.: A frontal solution program for finite element analysis. Int. J. Numer. Methods. Eng. 2, 5\u201332 (1970)","journal-title":"Int. J. Numer. Methods. Eng."},{"key":"9688_CR3","volume-title":"Matrix Computation for Engineers and Scientists","author":"A Jennings","year":"1977","unstructured":"Jennings, A.: Matrix Computation for Engineers and Scientists. John Wiley, Hoboken (1977)"},{"issue":"4","key":"9688_CR4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/nla.1680020402","volume":"2","author":"ST Barnard","year":"1995","unstructured":"Barnard, S.T., Pothen, A., Simon, H.: A spectral algorithm for envelope reduction of sparse matrices. Numer. Lin. Algebra. Appl. 2(4), 317\u2013334 (1995)","journal-title":"Numer. Lin. Algebra. Appl."},{"key":"9688_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"MR Gary","year":"1979","unstructured":"Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Company, New York (1979)"},{"issue":"3","key":"9688_CR6","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1137\/S089547989427470X","volume":"18","author":"A George","year":"1997","unstructured":"George, A., Pothen, A.: An analysis of spectral envelope reduction via quadratic assignment problems. SIAM J. Matrix Anal. Appl. 18(3), 706\u2013732 (1997)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9688_CR7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02006264","volume":"10","author":"Y Lin","year":"1994","unstructured":"Lin, Y., Yuan, J.: Profile minimization problem for matrices and graphs. Acta Math. Appl. Sin. 10, 107\u2013112 (1994)","journal-title":"Acta Math. Appl. Sin."},{"key":"9688_CR8","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA (1992)"},{"key":"9688_CR9","unstructured":"Poli, R., Langdon, W., McPhee, N.: A field guide to genetic programming. Lulu Enterprises, Raleigh (2008)."},{"key":"9688_CR10","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: ACM National Conference, pp. 157\u2013172. Association for Computing Machinery, New York (1969)."},{"issue":"2","key":"9688_CR11","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1137\/0713020","volume":"13","author":"WH Liu","year":"1976","unstructured":"Liu, W.H., Sherman, A.H.: Comparative analysis of the cuthill-mckee and the reverse Cuthill\u2013Mckee ordering algorithms for sparse matrices. SIAM J. Numer. Anal. 13(2), 198\u2013213 (1976)","journal-title":"SIAM J. Numer. Anal."},{"key":"9688_CR12","unstructured":"George, J.A.: Computer implementation of the finite element method. Ph.D. thesis, Stanford, CA (1971)."},{"key":"9688_CR13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-1-4615-8675-3_14","volume-title":"Sparse Matrices and their Applications. The IBM Research Symposia Series","author":"E Cuthill","year":"1972","unstructured":"Cuthill, E.: Several strategies for reducing the bandwidth of matrices. In: Rose, D., Willoughby, R. (eds.) Sparse Matrices and their Applications. The IBM Research Symposia Series, pp. 157\u2013166. Springer, US (1972)"},{"issue":"2","key":"9688_CR14","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1137\/0713023","volume":"13","author":"NE Gibbs","year":"1976","unstructured":"Gibbs, N.E., Poole, W.G., Stockmeyer, P.K.: An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM J. Numer. Anal. 13(2), 236\u2013250 (1976)","journal-title":"SIAM J. Numer. Anal."},{"key":"9688_CR15","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1002\/nme.1620140606","volume":"14","author":"GC Everstine","year":"1979","unstructured":"Everstine, G.C.: A comparison of three resequencing algorithms for the reduction of matrix profile and wavefront. Int. J. Numer. Methods. Eng. 14, 837\u2013853 (1979)","journal-title":"Int. J. Numer. Methods. Eng."},{"issue":"4","key":"9688_CR16","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1145\/355705.355713","volume":"2","author":"NE Gibbs","year":"1976","unstructured":"Gibbs, N.E.: A hybrid profile reduction algorithm. ACM Trans. Math. Softw. 2(4), 378\u2013387 (1976)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"9688_CR17","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1145\/355993.355998","volume":"8","author":"JG Lewis","year":"1982","unstructured":"Lewis, J.G.: Implementation of the gibbs-poole-stockmeyer and gibbs-king algorithms. ACM. Trans. Math. Softw. 8(2), 180\u2013189 (1982)","journal-title":"ACM. Trans. Math. Softw."},{"key":"9688_CR18","doi-asserted-by":"crossref","first-page":"1785","DOI":"10.1002\/nme.1620211005","volume":"21","author":"BA Armstrong","year":"1985","unstructured":"Armstrong, B.A.: Near minimal matrix profiles and wavefronts for testing nodal resequencing algorithms. Int. J. Numer. Methods. Eng. 21, 1785\u20131790 (1985)","journal-title":"Int. J. Numer. Methods. Eng."},{"issue":"11","key":"9688_CR19","doi-asserted-by":"crossref","first-page":"2651","DOI":"10.1002\/nme.1620281111","volume":"28","author":"SW Sloan","year":"1989","unstructured":"Sloan, S.W.: A FORTRAN program for profile and wavefront reduction. Int. J. Numer. Methods. Eng. 28(11), 2651\u20132679 (1989)","journal-title":"Int. J. Numer. Methods. Eng."},{"issue":"2","key":"9688_CR20","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0045-7949(89)90012-6","volume":"33","author":"SW Sloan","year":"1989","unstructured":"Sloan, S.W., Ng, W.S.: A direct comparison of three algorithms for reducing profile and wavefront. Comput. Struct. 33(2), 411\u2013419 (1989)","journal-title":"Comput. Struct."},{"issue":"11","key":"9688_CR21","doi-asserted-by":"crossref","first-page":"2555","DOI":"10.1002\/nme.1620281106","volume":"28","author":"I Duff","year":"1989","unstructured":"Duff, I., Reid, J.K., Scott, J.A.: The use of profile reduction algorithms with a frontal code. Int. J. Numer. Methods. Eng. 28(11), 2555\u20132568 (1989)","journal-title":"Int. J. Numer. Methods. Eng."},{"key":"9688_CR22","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/BF02510240","volume":"37","author":"G Kumfert","year":"1997","unstructured":"Kumfert, G., Pothen, A.: Two improved algorithms for envelope and wavefront reduction. BIT 37, 559\u2013590 (1997)","journal-title":"BIT"},{"key":"9688_CR23","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1002\/(SICI)1097-0207(19990830)45:12<1737::AID-NME652>3.0.CO;2-T","volume":"45","author":"JK Reid","year":"1999","unstructured":"Reid, J.K., Scott, J.A.: Ordering symmetric sparse matrices for small profile and wavefront. Int. J. Numer. Methods. Eng. 45, 1737\u20131755 (1999)","journal-title":"Int. J. Numer. Methods. Eng."},{"key":"9688_CR24","unstructured":"Barnard, S.T., Pothen, A., Simon, H.D.: A spectral algorithm for envelope reduction of sparse matrices. In: Proceedings of the Supercomputing \u201993: Proceedings of the 1993 ACM\/IEEE conference on Supercomputing, pp. 493\u2013502. ACM, New York (1993)."},{"issue":"4","key":"9688_CR25","doi-asserted-by":"crossref","first-page":"1352","DOI":"10.1137\/S1064827500377733","volume":"23","author":"YF Hu","year":"2001","unstructured":"Hu, Y.F., Scott, J.A.: A multilevel algorithm for wavefront reduction. SIAM J. Sci. Comput. 23(4), 1352\u20131375 (2001)","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"9688_CR26","doi-asserted-by":"crossref","first-page":"1799","DOI":"10.1137\/S1064827500379215","volume":"23","author":"W Hager","year":"2002","unstructured":"Hager, W.: Minimizing the profile of a symmetric matrix. SIAM J. Sci. Comput. 23(5), 1799\u20131816 (2002)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"9688_CR27","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/592843.592844","volume":"28","author":"JK Reid","year":"2002","unstructured":"Reid, J.K., Scott, J.A.: Implementing hager\u2019s exchange methods for matrix profile reduction. ACM Trans. Math. Softw. 28(4), 377\u2013391 (2002)","journal-title":"ACM Trans. Math. Softw."},{"key":"9688_CR28","doi-asserted-by":"crossref","first-page":"29","DOI":"10.2528\/PIERL09042305","volume":"9","author":"Q Wang","year":"2009","unstructured":"Wang, Q., Shi, X.W.: An improved algorithm for matrix bandwidth and profile reduction in finite element analysis. Prog. Electromagn. Res. Lett. 9, 29\u201338 (2009)","journal-title":"Prog. Electromagn. Res. Lett."},{"issue":"2","key":"9688_CR29","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1016\/S0377-2217(00)00325-8","volume":"135","author":"R Marti","year":"2001","unstructured":"Marti, R., Laguna, M., Glover, F., Campos, V.: Reducing the bandwidth of a sparse matrix with tabu search. Eur. J. Oper. Res. 135(2), 450\u2013459 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9688_CR30","unstructured":"Lim, A., Rodrigues, B., Xiao, F.: Integrated genetic algorithm with hill climbing for bandwidth minimization problem. In: Proceedings of the 2003 international conference on Genetic and evolutionary computation: Part II, pp. 1594\u20131595. Springer-Verlag, Berlin (2003)."},{"issue":"1","key":"9688_CR31","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/S0377-2217(02)00715-4","volume":"153","author":"E Pi\u00f1ana","year":"2004","unstructured":"Pi\u00f1ana, E., Plana, I., Campos, V., Mart\u00ed, R.: GRASP and path relinking for the matrix bandwidth minimization. Eur. J. Oper. Res. 153(1), 200\u2013210 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9688_CR32","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.asoc.2005.01.001","volume":"6","author":"A Lim","year":"2006","unstructured":"Lim, A., Lin, J., Rodrigues, B., Xiao, F.: Ant colony optimization with hill climbing for the bandwidth minimization problem. Appl. Soft. Comput. 6(2), 180\u2013188 (2006)","journal-title":"Appl. Soft. Comput."},{"issue":"3","key":"9688_CR33","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10489-006-0019-x","volume":"26","author":"A Lim","year":"2007","unstructured":"Lim, A., Lin, J., Xiao, F.: Particle swarm optimization and hill climbing for the bandwidth minimization problem. Appl. Intell. 26(3), 175\u2013182 (2007)","journal-title":"Appl. Intell."},{"issue":"3","key":"9688_CR34","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1016\/j.ejor.2005.12.052","volume":"185","author":"E Rodriguez-Tello","year":"2008","unstructured":"Rodriguez-Tello, E., Jin-Kao, H., Torres-Jimenez, J.: An improved simulated annealing algorithm for bandwidth minimization. Eur. J. Oper. Res. 185(3), 1319\u20131335 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"9688_CR35","doi-asserted-by":"crossref","first-page":"3331","DOI":"10.1016\/j.cor.2007.03.001","volume":"35","author":"E Rodriguez-Tello","year":"2008","unstructured":"Rodriguez-Tello, E., Hao, J.K., Torres-Jimenez, J.: An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. Comput. Oper. Res. 35(10), 3331\u20133346 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9688_CR36","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/0-387-28356-0_17","volume-title":"Search Methodologies","author":"P Ross","year":"2005","unstructured":"Ross, P.: Hyper-heuristics. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, pp. 529\u2013556. Springer, New York (2005)"},{"issue":"1","key":"9688_CR37","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.laa.2006.08.017","volume":"423","author":"NMM Abreu de","year":"2007","unstructured":"de Abreu, N.M.M.: Old and new results on algebraic connectivity of graphs. Lin. Algebra. Appl. 423(1), 53\u201373 (2007)","journal-title":"Lin. Algebra. Appl."},{"key":"9688_CR38","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak. Math. J. 23, 298\u2013305 (1973)","journal-title":"Czechoslovak. Math. J."},{"issue":"1","key":"9688_CR39","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.ejor.2005.02.066","volume":"174","author":"A Lim","year":"2006","unstructured":"Lim, A., Rodrigues, B., Xiao, F.: Heuristics for matrix bandwidth reduction. Eur. J. Oper. Res. 174(1), 69\u201391 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9688_CR40","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.ejor.2008.12.015","volume":"200","author":"N Mladenovic","year":"2010","unstructured":"Mladenovic, N., Urosevic, D., Prez-Brito, D., Garca-Gonzlez, C.G.: Variable neighbourhood search for bandwidth reduction. Eur. J. Oper. Res. 200(1), 14\u201327 (2010)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9688-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-014-9688-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9688-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T16:20:19Z","timestamp":1598199619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-014-9688-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,23]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9688"],"URL":"https:\/\/doi.org\/10.1007\/s10589-014-9688-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,23]]}}}