{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T20:16:02Z","timestamp":1776197762927,"version":"3.50.1"},"reference-count":104,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003593","name":"National Council for Scientific and Technological Development","doi-asserted-by":"publisher","award":["402599\/2023-3"],"award-info":[{"award-number":["402599\/2023-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Science Review"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.cosrev.2026.100962","type":"journal-article","created":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T16:01:32Z","timestamp":1775145692000},"page":"100962","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A survey of heuristics for the minimum linear arrangement problem"],"prefix":"10.1016","volume":"61","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4863-542X","authenticated-orcid":false,"given":"S.L.","family":"Gonzaga de Oliveira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6364-8347","authenticated-orcid":false,"given":"A.A.A.M.","family":"de Abreu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.cosrev.2026.100962_bib0005","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0112012","article-title":"Optimal assignments of numbers to vertices","volume":"12","author":"Harper","year":"1964","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"10.1016\/j.cosrev.2026.100962_bib0010","series-title":"17th International Symposium on Mathematical Foundations of Computer Science (MFCS)","first-page":"14","article-title":"Graph layout problems","volume":"vol. 629","author":"D\u00edaz","year":"1992"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100962_bib0015","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)00301-7","article-title":"The use of dynamic programming in genetic algorithms for permutation problems","volume":"92","author":"Yagiura","year":"1996","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cosrev.2026.100962_bib0020","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/568522.568523","article-title":"A survey on graph layout problems","volume":"34","author":"D\u00edaz","year":"2002","journal-title":"ACM Comput. Surv."},{"issue":"12","key":"10.1016\/j.cosrev.2026.100962_bib0025","doi-asserted-by":"crossref","first-page":"1839","DOI":"10.1109\/TCSI.2002.805729","article-title":"On critical spanning trees and the linear-arrangement problem","volume":"49","author":"Easton","year":"2002","journal-title":"IEEE Trans. Circuits Syst. I Fundam. Theory Appl."},{"issue":"2.3","key":"10.1016\/j.cosrev.2026.100962_bib0030","article-title":"Experiments on the minimum linear arrangement problem","volume":"8","author":"Petit","year":"2003","journal-title":"ACM J. Exp. Algorithmics"},{"key":"10.1016\/j.cosrev.2026.100962_bib0035","series-title":"Contributions to the Minimum Linear Arrangement Problem","author":"Seitz","year":"2010"},{"key":"10.1016\/j.cosrev.2026.100962_bib0040","first-page":"37","article-title":"Chassis Layout and Isoperimetric Problems","volume":"2","author":"Harper","year":"1970"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100962_bib0045","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0125042","article-title":"Optimal linear ordering","volume":"25","author":"Adolphson","year":"1973","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.cosrev.2026.100962_bib0050","series-title":"Proceedings of 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG\u201902), Vol. 2573 of Lecture Notes in Computer Science","first-page":"296","article-title":"A multi-scale algorithm for the linear arrangement problem","author":"Koren","year":"2002"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100962_bib0055","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","article-title":"Optimal numberings and isoperimetric problems on graphs","volume":"1","author":"Harper","year":"1966","journal-title":"J. Comb. Theory"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100962_bib0060","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/0208002","article-title":"A minimum linear arrangement algorithm for undirected trees","volume":"8","author":"Shiloach","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.cosrev.2026.100962_bib0065","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0166-218X(92)90229-4","article-title":"Optimal linear labelings and eigenvalues of graphs","volume":"36","author":"Juvan","year":"1992","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.cosrev.2026.100962_bib0070","first-page":"1321","article-title":"Graph layout problems","author":"Cavero","year":"2025"},{"key":"10.1016\/j.cosrev.2026.100962_bib0075","series-title":"Proceedings of the 6th Annual ACM Symposium on Theory of Computing (STOC)","first-page":"47","article-title":"Some simplified NP-complete problems","author":"Garey","year":"1974"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100962_bib0080","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.cosrev.2026.100962_bib0085","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100962_bib0090","first-page":"31","article-title":"Linear sum of graphs","volume":"30","author":"Tacbobo","year":"2007","journal-title":"Matimy\u00e1s Matematika - J. Math. Soc. Philipp."},{"key":"10.1016\/j.cosrev.2026.100962_bib0095","first-page":"384","article-title":"On a binary distance model for the minimum linear arrangement problem","volume":"22","author":"Reinelt","year":"2014","journal-title":"TOP - Trans. Oper. Res."},{"key":"10.1016\/j.cosrev.2026.100962_bib0100","first-page":"213","article-title":"Linear arrangement problems on recursively partitioned graphs","volume":"32","author":"Lengauer","year":"1988","journal-title":"ZOR - Z. Oper. Res."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100962_bib0105","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0898-1221(84)90085-3","article-title":"On optimal linear arrangements of trees","volume":"10","author":"Chung","year":"1984","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/j.cosrev.2026.100962_bib0110","series-title":"Proceedings of the 20th Annual Hawaii International Conference on System Sciences","first-page":"99","article-title":"Optimal linear arrangement of circuit components","author":"Bhasker","year":"1987"},{"issue":"6","key":"10.1016\/j.cosrev.2026.100962_bib0115","doi-asserted-by":"crossref","first-page":"1773","DOI":"10.1137\/S0097539797331671","article-title":"On bipartite drawings and the linear arrangement problem","volume":"30","author":"Shahrokhi","year":"2001","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.cosrev.2026.100962_bib0120","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0020-0190(03)00261-8","article-title":"Optimal one-page tree embeddings in linear time","volume":"87","author":"Hochberg","year":"2003","journal-title":"Inf. Process. Lett."},{"issue":"10","key":"10.1016\/j.cosrev.2026.100962_bib0125","doi-asserted-by":"crossref","first-page":"3331","DOI":"10.1016\/j.cor.2007.03.001","article-title":"An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem","volume":"35","author":"Rodriguez-Tello","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cosrev.2026.100962_bib0130","first-page":"358","article-title":"Minimum linear arrangement of chord graphs","volume":"203","author":"Rostami","year":"2008","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.cosrev.2026.100962_bib0135","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.ins.2013.02.037","article-title":"An optimal time algorithm for minimum linear arrangement of chord graphs","volume":"238","author":"Raoufi","year":"2013","journal-title":"Inf. Sci."},{"key":"10.1016\/j.cosrev.2026.100962_bib0140","series-title":"Minimum Linear Arrangement Revisited","author":"Z\u00fcndorf","year":"2022"},{"key":"10.1016\/j.cosrev.2026.100962_bib0145","series-title":"Fundamentals of Computation Theory. FCT 1987, Vol. 278 of Lecture Notes in Computer Science","first-page":"214","article-title":"Minimal numberings of the vertices of trees \u2013 approximate approach","author":"Iordanskii","year":"1987"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100962_bib0150","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0020-0190(03)00261-8","article-title":"Optimal one-page tree embeddings in linear time","volume":"87","author":"Hochberg","year":"2003","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.cosrev.2026.100962_bib0155","series-title":"Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics","first-page":"184","article-title":"Optimizing grammars for minimum dependency length","author":"Gildea","year":"2007"},{"key":"10.1016\/j.cosrev.2026.100962_bib0160","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipl.2021.106204","article-title":"Minimum projective linearizations of trees in linear time","volume":"174","author":"Alemany-Puig","year":"2022","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.cosrev.2026.100962_bib0165","author":"DeVos"},{"key":"10.1016\/j.cosrev.2026.100962_bib0170","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1016\/j.endm.2010.05.107","article-title":"Lower bounds for the minimum linear arrangement of a graph","volume":"36","author":"Caprara","year":"2010","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100962_bib0175","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1287\/ijoc.1100.0390","article-title":"Decorous lower bounds for minimum linear arrangement","volume":"23","author":"Caprara","year":"2011","journal-title":"Inf. J. Comput."},{"key":"10.1016\/j.cosrev.2026.100962_bib0180","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s11590-009-0130-0","article-title":"A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem","volume":"3","author":"Amaral","year":"2009","journal-title":"Optim. Lett."},{"key":"10.1016\/j.cosrev.2026.100962_bib0185","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.dam.2021.06.021","article-title":"A compact quadratic model and linearizations for the minimum linear arrangement problem","volume":"323","author":"de Andrade","year":"2022","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.cosrev.2026.100962_bib0190","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.endm.2008.01.016","article-title":"A new lower bound for the minimum linear arrangement of a graph","volume":"30","author":"Amaral","year":"2008","journal-title":"Electron. Notes Discrete Math."},{"issue":"4","key":"10.1016\/j.cosrev.2026.100962_bib0195","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3228342","article-title":"Approximation guarantees for the minimum linear arrangement problem by higher eigenvalues","volume":"14","author":"Tamaki","year":"2018","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.cosrev.2026.100962_bib0200","series-title":"11th Conference on Information Sciences and Systems","first-page":"91","article-title":"Some NP-complete problems on graphs","author":"Gavril","year":"1977"},{"key":"10.1016\/j.cosrev.2026.100962_bib0205","doi-asserted-by":"crossref","DOI":"10.1016\/j.cosrev.2025.100724","article-title":"A survey of heuristics for matrix bandwidth reduction","volume":"56","author":"Gonzaga de Oliveira","year":"2025","journal-title":"Comput. Sci. Rev."},{"issue":"5","key":"10.1016\/j.cosrev.2026.100962_bib0210","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3711120","article-title":"A survey of heuristics for profile and wavefront reductions","volume":"57","author":"Gonzaga de Oliveira","year":"2025","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.cosrev.2026.100962_bib0215","series-title":"A New Heuristic Algorithm for the Linear Arrangement Problem","author":"McAllister","year":"1999"},{"key":"10.1016\/j.cosrev.2026.100962_bib0220","series-title":"Complexity and Approximation","author":"Ausiello","year":"1999"},{"key":"10.1016\/j.cosrev.2026.100962_bib0225","series-title":"NP-Completeness of Several Arrangement Problems","author":"Even","year":"1975"},{"key":"10.1016\/j.cosrev.2026.100962_bib0230","series-title":"MFCS\u201906: Proceedings of the 31st International Conference on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science - LNCS, Vol. 4162","first-page":"267","article-title":"Optimal linear arrangement of interval graphs","author":"Cohen","year":"2006"},{"issue":"4\u20135","key":"10.1016\/j.cosrev.2026.100962_bib0235","first-page":"1123","article-title":"Lower and upper bounds for the linear arrangement problem on interval graphs","volume":"52","author":"Rebaine","year":"2018","journal-title":"RAIRO Oper. Res."},{"key":"10.1016\/j.cosrev.2026.100962_bib0240","series-title":"Approximation Heuristics and Benchmarkings for the MinLA Problem","author":"Petit","year":"1997"},{"key":"10.1016\/j.cosrev.2026.100962_bib0245","series-title":"Proceedings of Algorithms and Experiments (ALEX98)","first-page":"112","article-title":"Approximation heuristics and benchmarkings for the MinLA problem","author":"Petit","year":"1998"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100962_bib0250","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1142\/S0129626403001161","article-title":"Combining spectral sequencing and parallel simulated annealing for the MinLA problem","volume":"13","author":"Petit","year":"2003","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/j.cosrev.2026.100962_bib0255","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.jalgor.2004.10.004","article-title":"Graph minimum linear arrangement by multilevel weighted edge contractions","volume":"60","author":"Safro","year":"2006","journal-title":"J. Algorithms"},{"key":"10.1016\/j.cosrev.2026.100962_bib0260","series-title":"Proceedings of the 9th Design Automation Conference - DAC\u201972","first-page":"50","article-title":"Clustering and linear placement","author":"Schuler","year":"1972"},{"key":"10.1016\/j.cosrev.2026.100962_bib0265","series-title":"Proceedings of the 20th Design Automation Conference","first-page":"457","article-title":"Linear ordering and application to placement","author":"Kang","year":"1983"},{"key":"10.1016\/j.cosrev.2026.100962_bib0270","series-title":"Proceedings SPIE - the Visual Communications and Image Processing","first-page":"1192","article-title":"Ordering color maps for lossless compression","volume":"vol. 2308","author":"Memon","year":"1994"},{"issue":"126","key":"10.1016\/j.cosrev.2026.100962_bib0275","first-page":"79","article-title":"Some estimates for the length of an arbitrary graph (in russian)","volume":"14","author":"Muradyan","year":"1985","journal-title":"Mat. Vopr. Kibern. Vychisl. Tekhn."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100962_bib0280","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 J. Numer. Anal."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100962_bib0285","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0215041","article-title":"on the probable performance of heuristics for bandwidth minimization","volume":"15","author":"Turner","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.cosrev.2026.100962_bib0290","series-title":"Computer Implementation of the Finite Element Method","author":"George","year":"1971"},{"issue":"4","key":"10.1016\/j.cosrev.2026.100962_bib0295","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1137\/0907082","article-title":"A linear time implementation of profile reduction algorithms for sparse matrices","volume":"7","author":"Marro","year":"1986","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"4","key":"10.1016\/j.cosrev.2026.100962_bib0300","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1145\/355705.355713","article-title":"Algorithm 509: a hybrid profile reduction algorithm","volume":"2","author":"Gibbs","year":"1976","journal-title":"ACM Trans. Math. Softw."},{"key":"10.1016\/j.cosrev.2026.100962_bib0305","series-title":"Proceedings of 29th Midwest Symposium on Circuits and Systems (North-Holland, New York)","first-page":"435","article-title":"An eigenvector-based approach for multi-stack VLSI layout","author":"Vannelli","year":"1986"},{"key":"10.1016\/j.cosrev.2026.100962_bib0310","series-title":"Artificial Evolution (EA 2005), Vol. 3871 of Lecture Notes in Computer Science (LNCS)","first-page":"73","article-title":"Memetic algorithms for the MinLA problem","author":"Rodriguez-Tello","year":"2006"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100962_bib0315","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/jsir.2011040101","article-title":"Scatter search and path relinking. A tutorial on the linear arrangement problem","volume":"2","author":"Mart\u00ed","year":"2011","journal-title":"Int. J. Swarm Intell. Res."},{"issue":"3","key":"10.1016\/j.cosrev.2026.100962_bib0320","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1137\/S089547989427470X","article-title":"An analysis of spectral envelope reduction via quadratic assignment problems","volume":"18","author":"George","year":"1997","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"10.1016\/j.cosrev.2026.100962_bib0325","first-page":".1.4","article-title":"Multilevel algorithms for linear ordering problems","volume":"13","author":"Safro","year":"2008","journal-title":"ACM J. Exp. Algorithmics"},{"key":"10.1016\/j.cosrev.2026.100962_bib0330","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equations of state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"J. Chem. Phys."},{"key":"10.1016\/j.cosrev.2026.100962_bib0335","series-title":"Multi-Scale Algorithm for the Linear Arrangement Problem","author":"Koren","year":"2002"},{"issue":"4","key":"10.1016\/j.cosrev.2026.100962_bib0340","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00035","article-title":"Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems","volume":"5","author":"Bar-Yehuda","year":"2001","journal-title":"J. Graph Algorithms Appl."},{"key":"10.1016\/j.cosrev.2026.100962_bib0345","series-title":"Advances in Artificial Intelligence (MICAI 2006), Vol. 4293 of Lecture Notes in Computer Science (LNCS)","first-page":"392","article-title":"A refined evaluation function for the MinLA problem","author":"Rodriguez-Tello","year":"2006"},{"issue":"4","key":"10.1016\/j.cosrev.2026.100962_bib0350","doi-asserted-by":"crossref","first-page":"333","DOI":"10.3233\/FUN-2005-68403","article-title":"A genetic hillclimbing algorithm for the optimal linear arrangement problem","volume":"68","author":"Poranen","year":"2005","journal-title":"Fundam. Inform."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100962_bib0355","doi-asserted-by":"crossref","first-page":"3","DOI":"10.2298\/YJOR140928038M","article-title":"Variable neighborhood search for minimum linear arrangement problem","volume":"26","author":"Mladenovi\u0107","year":"2016","journal-title":"Yugosl. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100962_bib0360","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1504\/IJOR.2009.025009","article-title":"A new hybrid evolutionary algorithm for the MinLA problem","volume":"5","author":"Sharma","year":"2009","journal-title":"Int. J. Oper. Res."},{"key":"10.1016\/j.cosrev.2026.100962_bib0365","doi-asserted-by":"crossref","first-page":"7988","DOI":"10.1007\/s10489-022-03802-y","article-title":"On the solution of the graph bandwidth problem by means of search methods","volume":"53","author":"Koohestani","year":"2023","journal-title":"Appl. Intell."},{"key":"10.1016\/j.cosrev.2026.100962_bib0370","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/s10878-021-00801-6","article-title":"Metaheuristic algorithms for the bandwidth reduction of large-scale matrices","volume":"43","author":"Gonzaga de Oliveira","year":"2022","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.cosrev.2026.100962_bib0375","series-title":"Simulated Annealing: Theory and Applications. Mathematics and Its Applications","volume":"vol. 37","author":"van Laarhoven","year":"1987"},{"issue":"5","key":"10.1016\/j.cosrev.2026.100962_bib0380","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/S0305-0548(98)00062-8","article-title":"A fast method for generalized starting temperature determination in homogeneous two-stage simulated annealing systems","volume":"26","author":"Varanelli","year":"1999","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cosrev.2026.100962_bib0385","author":"Gardeyn"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100962_bib0390","first-page":"1","article-title":"The university of Florida sparse matrix collection","volume":"38","author":"Davis","year":"2011","journal-title":"ACM Trans. Math. Softw."},{"key":"10.1016\/j.cosrev.2026.100962_bib0395","author":"Bartz-Beielstein"},{"key":"10.1016\/j.cosrev.2026.100962_bib0400","series-title":"Experiments on the Minimum Linear Arrangement Problem","author":"Petit","year":"2001"},{"issue":"11","key":"10.1016\/j.cosrev.2026.100962_bib0405","doi-asserted-by":"crossref","first-page":"1801","DOI":"10.1109\/PROC.1967.6011","article-title":"Direct solutions of sparse network equations by optimally ordered triangular factorization","volume":"55","author":"Tinney","year":"1967","journal-title":"Proc. IEEE"},{"key":"10.1016\/j.cosrev.2026.100962_bib0410","first-page":"43","article-title":"The irace package: iterated racing for automatic algorithm configuration","volume":"3","author":"L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","journal-title":"Oper. Res. Perspect."},{"issue":"4","key":"10.1016\/j.cosrev.2026.100962_bib0415","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1007\/s00366-019-00801-5","article-title":"Evolving reordering algorithms using an ant colony hyperheuristic approach for accelerating the convergence of the ICCG method","volume":"36","author":"Gonzaga de Oliveira","year":"2020","journal-title":"Eng. with Comput."},{"key":"10.1016\/j.cosrev.2026.100962_bib0420","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106434","article-title":"An ant colony hyperheuristic approach for matrix bandwidth reduction","volume":"94","author":"Gonzaga de Oliveira","year":"2020","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100962_bib0425","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1137\/0206002","article-title":"Single machine job sequencing with precedence constraints","volume":"6","author":"Adolphson","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.cosrev.2026.100962_bib0430","series-title":"Proceedings of the 18th International Colloquium on Automata, Languages and Programming","first-page":"751","article-title":"Ordering problems approximated: single-processor scheduling and interval graph completion","author":"Ravi","year":"1991"},{"issue":"12","key":"10.1016\/j.cosrev.2026.100962_bib0435","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0898-1221(90)90251-E","article-title":"Branch distance optimization of structured programs","volume":"19","author":"Powell","year":"1990","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/j.cosrev.2026.100962_bib0440","series-title":"Pacific Symposium on Biocomputing","first-page":"67","article-title":"Massively parallel algorithms for chromosome reconstruction","author":"Bhandarkar","year":"1996"},{"issue":"4","key":"10.1016\/j.cosrev.2026.100962_bib0445","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/0607063","article-title":"Optimal numberings of ann\u00d7narray","volume":"7","author":"Mitchison","year":"1986","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/j.cosrev.2026.100962_bib0450","series-title":"Grid and Cooperative Computing - GCC 2005, Vol. 3795 of Lecture Notes in Computer Science","first-page":"906","article-title":"A mathematical foundation for topology awareness of p2p overlay networks","author":"Rostami","year":"2005"},{"issue":"7","key":"10.1016\/j.cosrev.2026.100962_bib0455","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1002\/cpe.1089","article-title":"Topology awareness of overlay p2p networks","volume":"19","author":"Rostami","year":"2007","journal-title":"Concurr.: Pract. & Exp."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100962_bib0460","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1093\/comjnl\/bxu031","article-title":"Minimum linear arrangement of incomplete hypercubes","volume":"58","author":"Miller","year":"2015","journal-title":"The Comput. J."},{"key":"10.1016\/j.cosrev.2026.100962_bib0465","series-title":"IML \u201917: Proceedings of the 1st International Conference on Internet of Things and Machine Learning","first-page":"1","article-title":"Spatial classification with fuzzy lattice reasoning","author":"Mavridis","year":"2017"},{"key":"10.1016\/j.cosrev.2026.100962_bib0470","series-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201907","first-page":"541","article-title":"A divide and conquer algorithm for d-dimensional arrangement","author":"Charikar","year":"2007"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100962_bib0475","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1137\/S0097539702413197","article-title":"New approximation techniques for some linear ordering problems","volume":"34","author":"Rao","year":"2005","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.cosrev.2026.100962_bib0480","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1287\/opre.1080.0548","article-title":"An exact approach to the one-dimensional facility layout problem","volume":"56","author":"Amaral","year":"2008","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.cosrev.2026.100962_bib0485","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.disopt.2012.07.002","article-title":"Exact solution of the 2-dimensional grid arrangement problem","volume":"9","author":"Oswald","year":"2012","journal-title":"Discrete Optim."},{"key":"10.1016\/j.cosrev.2026.100962_bib0490","series-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","first-page":"206","article-title":"Approximating minimum linear ordering problems","author":"Iwata","year":"2012"},{"key":"10.1016\/j.cosrev.2026.100962_bib0495","series-title":"Hybrid Metaheuristics","first-page":"155","article-title":"JAM: a tabu-based two-stage simulated annealing algorithm for the multidimensional arrangement problem","author":"Aroca","year":"2014"},{"key":"10.1016\/j.cosrev.2026.100962_bib0500","series-title":"The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization","author":"Mart\u00ed","year":"2011"},{"issue":"4","key":"10.1016\/j.cosrev.2026.100962_bib0505","doi-asserted-by":"crossref","first-page":"487","DOI":"10.2307\/1907514","article-title":"International comparisons of the structure of production","volume":"26","author":"Chenery","year":"1958","journal-title":"Econometrica"},{"issue":"4","key":"10.1016\/j.cosrev.2026.100962_bib0510","doi-asserted-by":"crossref","DOI":"10.1007\/s10878-024-01209-8","article-title":"Efficient heuristics to compute minimal and stable feedback ARC sets","volume":"48","author":"Cavallaro","year":"2024","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.cosrev.2026.100962_bib0515","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107247","article-title":"Minimal and stable feedback ARC sets and graph centrality measures","volume":"184","author":"Cavallaro","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cosrev.2026.100962_bib0520","series-title":"Proceedings of the 37th International Conference on Software Engineering and Knowledge Engineering, Vol. 2025 of SEKE2025","first-page":"84","article-title":"An efficient heuristic algorithm to compute minimal and stable weighted feedback ARC sets (s)","author":"Cavallaro","year":"2025"}],"container-title":["Computer Science Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574013726000705?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574013726000705?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T19:17:24Z","timestamp":1776194244000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1574013726000705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":104,"alternative-id":["S1574013726000705"],"URL":"https:\/\/doi.org\/10.1016\/j.cosrev.2026.100962","relation":{},"ISSN":["1574-0137"],"issn-type":[{"value":"1574-0137","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A survey of heuristics for the minimum linear arrangement problem","name":"articletitle","label":"Article Title"},{"value":"Computer Science Review","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cosrev.2026.100962","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"100962"}}