{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:01:35Z","timestamp":1648951295292},"reference-count":20,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":1055,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer. Linear Algebra Appl."],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1002\/nla.1859","type":"journal-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T09:01:45Z","timestamp":1349946105000},"page":"51-67","source":"Crossref","is-referenced-by-count":2,"title":["Level-based heuristics and hill climbing for the antibandwidth\u2009maximization problem"],"prefix":"10.1002","volume":"21","author":[{"given":"Jennifer","family":"Scott","sequence":"first","affiliation":[{"name":"Computational Science and Engineering Department; Rutherford Appleton Laboratory; Chilton Oxfordshire OX11 0QX UK"}]},{"given":"Yifan","family":"Hu","sequence":"additional","affiliation":[{"name":"AT&T Labs Research; 180 Park Avenue Florham Park NJ 07932 USA"}]}],"member":"311","published-online":{"date-parts":[[2012,10,11]]},"reference":[{"key":"10.1002\/nla.1859-BIB0001|nla1859-cit-0001","doi-asserted-by":"crossref","unstructured":"Cuthill E McKee J Reducing the bandwidth of sparse symmetric matrices Proceedings of the 24th National Conference of the ACM 1969","DOI":"10.1145\/800195.805928"},{"key":"10.1002\/nla.1859-BIB0002|nla1859-cit-0002","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1137\/0713023","article-title":"An algorithm for reducing the bandwidth and profile of a sparse matrix","volume":"13","author":"Gibbs","year":"1976","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"10.1002\/nla.1859-BIB0003|nla1859-cit-0003","article-title":"A centroid-based approach to solve the bandwidth minimization problem","author":"Lim","year":"2004","journal-title":"Proceedings of the 37th Hawaii International Conference on System Sciences, IEEE"},{"key":"10.1002\/nla.1859-BIB0004|nla1859-cit-0004","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0377-2217(00)00325-8","article-title":"Reducing the bandwidth of a sparse matrix with tabu search","volume":"135","author":"Mart\u00ed","year":"2001","journal-title":"European J. of Operational Research"},{"key":"10.1002\/nla.1859-BIB0005|nla1859-cit-0005","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/S0377-2217(02)00715-4","article-title":"GRASP and path relinking for the matrix bandwidth minimization","volume":"153","author":"Nana","year":"2004","journal-title":"European J. of Operational Research"},{"key":"10.1002\/nla.1859-BIB0006|nla1859-cit-0006","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1137\/0213040","article-title":"On some variants of the bandwidth minimization problem","volume":"13","author":"Leung","year":"1984","journal-title":"SIAM Journal on Computing"},{"key":"10.1002\/nla.1859-BIB0007|nla1859-cit-0007","first-page":"1","article-title":"The dual bandwidth problem for graphs","volume":"35","author":"Yixen","year":"2003","journal-title":"Journal of Zhengzhou University"},{"key":"10.1002\/nla.1859-BIB0008|nla1859-cit-0008","unstructured":"Cappanera P A survey of obnoxious facility location problems TR-99-11 1999"},{"key":"10.1002\/nla.1859-BIB0009|nla1859-cit-0009","doi-asserted-by":"crossref","first-page":"3541","DOI":"10.1016\/j.disc.2007.12.058","article-title":"Antibandwidth and cyclic antibandwidth of meshes and hypercubes","volume":"309","author":"Raspaud","year":"2009","journal-title":"Discrete Mathematics"},{"key":"10.1002\/nla.1859-BIB0010|nla1859-cit-0010","doi-asserted-by":"crossref","unstructured":"Hu Y.\u2009F Kobourov S Veeramoni S On maximum differential graph coloring Proceedings of the 18th International Conference on Graph Drawing (GD\u201910) 2011 274 286","DOI":"10.1007\/978-3-642-18469-7_25"},{"key":"10.1002\/nla.1859-BIB0011|nla1859-cit-0011","doi-asserted-by":"crossref","DOI":"10.1002\/net.20418","article-title":"GRASP with path relinking heuristics for the antibandwidth problem","author":"Duarte","year":"2011","journal-title":"Networks"},{"key":"10.1002\/nla.1859-BIB0012|nla1859-cit-0012","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1002\/(SICI)1097-0207(19990830)45:12<1737::AID-NME652>3.0.CO;2-T","article-title":"Ordering symmetric sparse matrices for small profile and wavefront","volume":"45","author":"Reid","year":"1999","journal-title":"International Journal on Numerical Methods in Engineering"},{"key":"10.1002\/nla.1859-BIB0013|nla1859-cit-0013","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1002\/cnm.1640101107","article-title":"A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph","volume":"10","author":"Paulino","year":"1994","journal-title":"Communications in Numerical Methods in Engineering"},{"key":"10.1002\/nla.1859-BIB0014|nla1859-cit-0014","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1002\/net.3230190604","article-title":"On the separation number of a graph","volume":"19","author":"Miller","year":"1989","journal-title":"Networks"},{"key":"10.1002\/nla.1859-BIB0015|nla1859-cit-0015","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/j.disc.2009.03.029","article-title":"Antibandwidth of three-dimensional meshes","volume":"310","author":"T\u00f6r\u00f6k","year":"2010","journal-title":"Discrete Mathematics"},{"issue":"3","key":"10.1002\/nla.1859-BIB0016|nla1859-cit-0016","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1137\/050629938","article-title":"Reducing the total bandwidth of a sparse unsymmetric matrix","volume":"28","author":"Reid","year":"2006","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"1","key":"10.1002\/nla.1859-BIB0017|nla1859-cit-0017","doi-asserted-by":"crossref","DOI":"10.1145\/2049662.2049663","article-title":"The University of Florida Sparse Matrix Collection","volume":"38","author":"Davis","year":"2011","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10.1002\/nla.1859-BIB0018|nla1859-cit-0018","unstructured":"George A Computer implementation of the finite-element method STAN CS-71-208, Ph.D Thesis 1971"},{"key":"10.1002\/nla.1859-BIB0019|nla1859-cit-0019","doi-asserted-by":"crossref","first-page":"1352","DOI":"10.1137\/S1064827500377733","article-title":"A multilevel algorithm for wavefront reduction","volume":"23","author":"Hu","year":"2001","journal-title":"SIAM Journal on Scientific Computing"},{"key":"10.1002\/nla.1859-BIB0020|nla1859-cit-0020","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/BF02510240","article-title":"Two improved algorithms for envelope and wavefront reduction","volume":"37:3","author":"Kumfert","year":"1997","journal-title":"BIT"}],"container-title":["Numerical Linear Algebra with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnla.1859","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/nla.1859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T11:56:20Z","timestamp":1562241380000},"score":1,"resource":{"primary":{"URL":"http:\/\/doi.wiley.com\/10.1002\/nla.1859"}},"subtitle":["THE ANTIBANDWIDTH MAXIMIZATION PROBLEM"],"short-title":[],"issued":{"date-parts":[[2012,10,11]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"URL":"https:\/\/doi.org\/10.1002\/nla.1859","relation":{},"ISSN":["1070-5325"],"issn-type":[{"value":"1070-5325","type":"print"}],"subject":[],"published":{"date-parts":[[2012,10,11]]}}}