{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:54:50Z","timestamp":1781463290989,"version":"3.54.1"},"reference-count":48,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100001244","name":"The Milken Family Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100001244","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.05.001","type":"journal-article","created":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T10:48:32Z","timestamp":1779101312000},"page":"231-248","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A probabilistic algorithm for Optimal Linear Arrangements"],"prefix":"10.1016","volume":"391","author":[{"given":"D.","family":"Berend","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Mamana","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.05.001_b1","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."},{"issue":"3","key":"10.1016\/j.dam.2026.05.001_b2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0125042","volume":"25","author":"Adolphson","year":"1973","journal-title":"SIAM J. Appl. Mathem."},{"key":"10.1016\/j.dam.2026.05.001_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipl.2023.106400","article-title":"The maximum linear arrangement problem for trees under projectivity and planarity","volume":"183","author":"Alemany-Puig","year":"2024","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.dam.2026.05.001_b4","series-title":"The Probabilistic Method","author":"Alon","year":"2016"},{"issue":"5","key":"10.1016\/j.dam.2026.05.001_b5","doi-asserted-by":"crossref","first-page":"3711","DOI":"10.1007\/s10878-022-00907-5","article-title":"Using the method of conditional expectations to supply an improved starting point for CCLS","volume":"44","author":"Berend","year":"2022","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2026.05.001_b6","series-title":"18th International Symposium on Experimental Algorithms (SEA 2020)","article-title":"Effect of initial assignment on local search performance for max sat","author":"Berend","year":"2020"},{"key":"10.1016\/j.dam.2026.05.001_b7","first-page":"157","article-title":"Edge isoperimetric problems on graphs (a survey)","volume":"7","author":"Bezrukov","year":"1999","journal-title":"Graph Theory Comb. Biol."},{"key":"10.1016\/j.dam.2026.05.001_b8","first-page":"87","article-title":"Optimal linear arrangement of circuit components","volume":"2","author":"Bhasker","year":"1987","journal-title":"J. VLSI Comput. Syst."},{"key":"10.1016\/j.dam.2026.05.001_b9","series-title":"41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)","article-title":"An improved approximation algorithm for dynamic minimum linear arrangement","author":"Bienkowski","year":"2024"},{"issue":"5","key":"10.1016\/j.dam.2026.05.001_b10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/MCD.1985.6312016","article-title":"Near-optimal quadratic-based placement for a class of IC layout problems","volume":"1","author":"Blanks","year":"1985","journal-title":"IEEE Circuits Devices"},{"key":"10.1016\/j.dam.2026.05.001_b11","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"2001"},{"key":"10.1016\/j.dam.2026.05.001_b12","doi-asserted-by":"crossref","unstructured":"R Ferrer-i Cancho, The sum of edge lengths in random linear arrangements, J. Stat. Mech. Theory Exp. 2019, http:\/\/dx.doi.org\/10.1088\/1742-5468\/ab11e2.","DOI":"10.1088\/1742-5468\/ab11e2"},{"key":"10.1016\/j.dam.2026.05.001_b13","series-title":"Labelings of Graphs","first-page":"151","author":"Chung","year":"1988"},{"key":"10.1016\/j.dam.2026.05.001_b14","doi-asserted-by":"crossref","unstructured":"J. Cohen, F. Fomin, P. Heggernes, D. Kratsch, G Kucherov, Optimal linear arrangement of interval graphs, Mathematical Foundations of Computer Science 2006: 31st International Symposium, MFCS 2006, Star\u00e1 Lesn\u00e1, Slovakia, August 28-September 1, 2006. Proceedings 31, Springer Berlin Heidelberg., pp. 267\u2013279.","DOI":"10.1007\/11821069_24"},{"key":"10.1016\/j.dam.2026.05.001_b15","unstructured":"D. Coudert, Linear ordering problems on graphs. https:\/\/www-sop.inria.fr\/members\/David.Coudert\/code\/graph-linear-ordering.shtml."},{"key":"10.1016\/j.dam.2026.05.001_b16","series-title":"A note on Integer Linear Programming formulations for linear ordering problems on graphs","author":"Coudert","year":"2016"},{"key":"10.1016\/j.dam.2026.05.001_b17","series-title":"Learning minimum linear arrangement of cliques and lines","author":"Dallot","year":"2024"},{"key":"10.1016\/j.dam.2026.05.001_b18","series-title":"A Survey on graph layout problems","author":"Diaz","year":"2000"},{"issue":"3","key":"10.1016\/j.dam.2026.05.001_b19","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1137\/15M1046289","article-title":"A correction on shiloach\u2019s algorithm for minimum linear arrangement of trees","volume":"46","author":"Esteban","year":"2017","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2026.05.001_b20","series-title":"NP-completeness of several arrangement problems","author":"Even","year":"1975"},{"key":"10.1016\/j.dam.2026.05.001_b21","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0012-365X(99)00173-9","article-title":"Optimal linear arrangement of a rectangular grid","volume":"213","author":"Fishburn","year":"2000","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.dam.2026.05.001_b22","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","article-title":"Complexity results for bandwidth minimization","volume":"34","author":"Garey","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.dam.2026.05.001_b23","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/j.dam.2026.05.001_b24","series-title":"Proceedings of the Sixth Annual ACM Symposium on Theory of Computing","first-page":"47","article-title":"Some simplified NP-complete problems","author":"Garey","year":"1974"},{"key":"10.1016\/j.dam.2026.05.001_b25","first-page":"553","article-title":"An algorithm of a minimal placing of a tree on the line","volume":"83","author":"Goldberg","year":"1976","journal-title":"SSR Mech. Acad. Moambe"},{"issue":"1","key":"10.1016\/j.dam.2026.05.001_b26","first-page":"131","article-title":"Optimal assignments of numbers to vertices","volume":"12","author":"Harper","year":"1964","journal-title":"J. SIAM"},{"key":"10.1016\/j.dam.2026.05.001_b27","first-page":"37","article-title":"Chassis layout and isoperimetric problems","volume":"11","author":"Harper","year":"1970","journal-title":"Jet Propuls. Lab. SPS"},{"key":"10.1016\/j.dam.2026.05.001_b28","series-title":"The optimal linear arrangement problem: algorithms and approximation","author":"Horton","year":"1997"},{"issue":"1\u20133","key":"10.1016\/j.dam.2026.05.001_b29","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0166-218X(00)00173-6","article-title":"On minimum cuts and the linear arrangement problem","volume":"103","author":"Horton","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.001_b30","series-title":"Ight approximations for graphical house allocation","author":"Hosseini","year":"2023"},{"key":"10.1016\/j.dam.2026.05.001_b31","series-title":"Large deviation methods for approximate probabilistic inference","author":"Kearns","year":"2013"},{"key":"10.1016\/j.dam.2026.05.001_b32","series-title":"International Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"296","article-title":"A multi-scale algorithm for the linear arrangement problem","author":"Koren","year":"2002"},{"issue":"2","key":"10.1016\/j.dam.2026.05.001_b33","first-page":"105","article-title":"Algorithm for a minimum linear arrangement (minla) of lattice graph","volume":"24","author":"Lee","year":"2024","journal-title":"J. Inst. InternetBroadcast. Commun."},{"issue":"2","key":"10.1016\/j.dam.2026.05.001_b34","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/j.ejor.2007.02.004","article-title":"Branch and bound algorithm for the matrix bandwidth minimization","volume":"186","author":"Mart\u00ed","year":"2008","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.dam.2026.05.001_b35","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.cor.2012.05.016","article-title":"Branch and bound for the cutwidth minimization problem","volume":"40","author":"Mart\u00ed","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.dam.2026.05.001_b36","article-title":"Cybersecurity and applied mathematics","author":"Metcalf","year":"2016","journal-title":"Syngress"},{"issue":"4","key":"10.1016\/j.dam.2026.05.001_b37","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/0607063","article-title":"Optimal numberings of an N\u00d7N array","volume":"7","author":"Mitchison","year":"1986","journal-title":"SIAM J. Algeb. Discret. Meth."},{"issue":"70","key":"10.1016\/j.dam.2026.05.001_b38","first-page":"21","article-title":"Minimal numberings of vertices of a rectangular lattice","volume":"1","author":"Muradyan","year":"1980","journal-title":"Akad. Nauk. Armjan. SRR"},{"key":"10.1016\/j.dam.2026.05.001_b39","series-title":"International Workshop on Approximation and Online Algorithms","first-page":"310","article-title":"The itinerant list update problem","author":"Olver","year":"2018"},{"key":"10.1016\/j.dam.2026.05.001_b40","doi-asserted-by":"crossref","unstructured":"J. Petit, Experiments on the minimum linear arrangement problem, J. Exp. Algorithmics (JEA) 8, 2003.","DOI":"10.1145\/996546.996554"},{"issue":"1","key":"10.1016\/j.dam.2026.05.001_b41","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":"Pi\u0144ana","year":"2004","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.dam.2026.05.001_b42","series-title":"Automata Languages and Programming","first-page":"751","article-title":"Ordering problems approximated: single-processor scheduling and interval graph completition","volume":"Vol. 510","author":"Ravi","year":"1991"},{"key":"10.1016\/j.dam.2026.05.001_b43","series-title":"Data Structures and Algorithms [cs. DS]","article-title":"Optimization algorithms for graph layout problems","author":"Ren","year":"2020"},{"key":"10.1016\/j.dam.2026.05.001_b44","first-page":"26","article-title":"A remark on stirling\u2019s formula","volume":"62","author":"Robbins","year":"1955","journal-title":"Am. Math. Mon."},{"issue":"6","key":"10.1016\/j.dam.2026.05.001_b45","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."},{"issue":"1","key":"10.1016\/j.dam.2026.05.001_b46","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.dam.2026.05.001_b47","series-title":"A Course in Probability","author":"Weiss","year":"2005"},{"key":"10.1016\/j.dam.2026.05.001_b48","series-title":"Minimum Linear Arrangement revisited","author":"Zundorf","year":"2022"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002842?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002842?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:06:39Z","timestamp":1781460399000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":48,"alternative-id":["S0166218X26002842"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.001","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A probabilistic algorithm for Optimal Linear Arrangements","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}