{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T05:02:55Z","timestamp":1783141375333,"version":"3.54.6"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,1,18]],"date-time":"2007-01-18T00:00:00Z","timestamp":1169078400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,1,18]],"date-time":"2007-01-18T00:00:00Z","timestamp":1169078400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s10489-006-0019-x","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T13:21:05Z","timestamp":1169040065000},"page":"175-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Particle Swarm Optimization and Hill Climbing for the bandwidth minimization problem"],"prefix":"10.1007","volume":"26","author":[{"given":"Andrew","family":"Lim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fei","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,1,18]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"CH Papadimitriou","year":"1976","unstructured":"Papadimitriou CH (1976) The NP-completeness of the bandwidth minimization problem. Computing 16:263\u2013270","journal-title":"Computing"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Unger W (1998) The complexity of the approximation of the bandwidth problem. 37th annual symposium on foundations of computer science, pp 82\u201391","DOI":"10.1109\/SFCS.1998.743431"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"CutHill E, McKee J (1969) Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the ACM national conference. Association for computing machinery, New York, pp 157\u2013172","DOI":"10.1145\/800195.805928"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1002\/nme.1620020406","volume":"2","author":"IP King","year":"1970","unstructured":"King IP (1970) An automatic reordering schema for simultaneous equations derived from network system. Int J Numer Meth Eng 2:523\u2013533","journal-title":"Int J Numer Meth Eng"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1137\/0713023","volume":"13","author":"NE Gibbs","year":"1976","unstructured":"Gibbs NE, Poole WG, Stockmeyer PK (1976) An algorithm for reducing the bandwidth and profile of sparse matrix. SIAM J Numer Anal 13(2):236\u2013250","journal-title":"SIAM J Numer Anal"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0377-2217(00)00325-8","volume":"135","author":"R Marti","year":"2001","unstructured":"Marti R, Laguna M, Glover F, Campos V (2001) Reducing the bandwidth of a sparse matrix with Tabu Search. Eur J Operat Res 135(2):211\u2013220","journal-title":"Eur J Operat Res"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/S0377-2217(02)00715-4","volume":"153","author":"E Pinana","year":"2004","unstructured":"Pinana E, Plana I, Campos V, Marti R (2004) GRASP and path relinking for the matrix bandwidth minimization. Eur J Operat Res 153(1):200\u2013210","journal-title":"Eur J Operat Res"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle Swarm Optimization. In: IEEE international conference on neural networks (Perth, Australia). IEEE Service Center, Piscataway, NJ, vol IV, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"19_CR9","unstructured":"Esposito A, Catalano MSF, Malucelli F, Tarricone L (1999) Sparse matrix bandwidth reduction: algorithms, applications and real industrial cases in electromagnetics. In: Paprzyky M (ed) High performance algorithms for structured matrix problems."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1997) A discrete binary version of particle swarm algorithm. In: 1997 IEEE conference on systems, man, and cybernetics. Orlando, FL, pp 4104\u20134109","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Shi YH, Eberhart RC (1998) Parameter selection in particle swarm optimization. In: Seventh annual conference on evolutionary programming, San Diego, CA","DOI":"10.1007\/BFb0040810"},{"key":"19_CR12","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 (1997) Tabu search. Kluwer Academic, Boston"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-006-0019-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-006-0019-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-006-0019-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-006-0019-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T23:43:09Z","timestamp":1652830989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-006-0019-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,18]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["19"],"URL":"https:\/\/doi.org\/10.1007\/s10489-006-0019-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,18]]},"assertion":[{"value":"18 January 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}