{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T14:24:57Z","timestamp":1770906297968,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00397-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"665-678","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":22,"title":["Heuristics and meta-heuristics for 2-layer straight line crossing minimization"],"prefix":"10.1016","volume":"127","author":[{"given":"Rafael","family":"Mart\u0131\u0301","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Laguna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/S0166-218X(02)00397-9_BIB1","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1109\/TSMC.1980.4308390","article-title":"Automatic display of hierarchized graphs for computer aided decision analysis","volume":"10","author":"Carpano","year":"1980","journal-title":"IEEE Trans. Systems Man Cybernetics"},{"key":"10.1016\/S0166-218X(02)00397-9_BIB2","doi-asserted-by":"crossref","unstructured":"M. Dell'Amico, F. Maffioli, A new tabu search approach to the 0-1 equicut problem, in: I.H. Osman, J.P. Kelly (Eds.), Metaheuristics: Theory and Applications, 1996, pp. 361\u2013377.","DOI":"10.1007\/978-1-4613-1361-8_23"},{"key":"10.1016\/S0166-218X(02)00397-9_BIB3","first-page":"89","article-title":"Heuristics for drawing 2-layered networks","volume":"21","author":"Eades","year":"1986","journal-title":"Ars Combin"},{"key":"10.1016\/S0166-218X(02)00397-9_BIB4","unstructured":"P. Eades, N.C. Wormald, The median heuristic for drawing 2-layered networks, Technical Report 69, Department of Computer Science, University of Queensland, 1986."},{"key":"10.1016\/S0166-218X(02)00397-9_BIB5","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01187020","article-title":"Edge crossing in drawings of bipartite graphs","volume":"11","author":"Eades","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(02)00397-9_BIB6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","article-title":"A probabilistic heuristic for a computationally difficult set covering problem","volume":"8","author":"Feo","year":"1989","journal-title":"Oper. Res. Lett"},{"key":"10.1016\/S0166-218X(02)00397-9_BIB7","first-page":"127","article-title":"Greedy randomized adaptive search procedures","volume":"2","author":"Feo","year":"1995","journal-title":"J. Global Optimization"},{"issue":"3","key":"10.1016\/S0166-218X(02)00397-9_BIB8","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/32.221135","article-title":"A technique for drawing directed graphs","volume":"19","author":"Gansner","year":"1993","journal-title":"IEEE Trans. Software Eng"},{"issue":"11","key":"10.1016\/S0166-218X(02)00397-9_BIB9","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1002\/spe.4380181104","article-title":"DAG\u2014a program that draws directed graphs","volume":"18","author":"Gansner","year":"1988","journal-title":"Software Practice Experience"},{"key":"10.1016\/S0166-218X(02)00397-9_BIB10","series-title":"Tabu Search","author":"Glover","year":"1997"},{"key":"10.1016\/S0166-218X(02)00397-9_BIB11","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0196-6774(82)90026-8","article-title":"The NP-completeness column","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(02)00397-9_BIB12","doi-asserted-by":"crossref","unstructured":"M. J\u00fcnger, P. Mutzel, Exact and Heuristic Algorithms for 2-Layer Straight Line Crossing Minimization, Lecture Notes in Computer Science, Graph Drawing 95, Springer, Berlin, 1995, pp. 337\u2013348.","DOI":"10.1007\/BFb0021817"},{"key":"10.1016\/S0166-218X(02)00397-9_BIB13","series-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"Knuth","year":"1993"},{"issue":"4","key":"10.1016\/S0166-218X(02)00397-9_BIB14","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1287\/opre.42.4.677","article-title":"A greedy randomized adaptive search procedure for the two-partition problem","volume":"42","author":"Laguna","year":"1994","journal-title":"Oper. Res"},{"issue":"1","key":"10.1016\/S0166-218X(02)00397-9_BIB15","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","article-title":"GRASP and path relinking for 2-layer straight line crossing minimization","volume":"11","author":"Laguna","year":"1999","journal-title":"INFORMS J. Comput"},{"issue":"12","key":"10.1016\/S0166-218X(02)00397-9_BIB16","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1016\/S0305-0548(96)00083-4","article-title":"Arc crossing minimization in hierarchical digraphs with tabu search","volume":"24","author":"Laguna","year":"1997","journal-title":"Comput. Oper. Res"},{"key":"10.1016\/S0166-218X(02)00397-9_BIB17","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/00207169008803921","article-title":"Experiments on drawing 2-level hierarchical graphs","volume":"36","author":"Makinen","year":"1990","journal-title":"Internat. J. Comput. Math"},{"key":"10.1016\/S0166-218X(02)00397-9_BIB18","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/S0377-2217(97)00291-9","article-title":"A tabu search algorithm for the bipartite drawing problem","volume":"106","author":"Mart\u0131\u0301","year":"1998","journal-title":"Eur. J. Oper. Res"},{"issue":"2","key":"10.1016\/S0166-218X(02)00397-9_BIB19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","article-title":"Methods for visual understanding of hierarchical system structures","volume":"11","author":"Sugiyama","year":"1981","journal-title":"IEEE Trans. Systems Man Cybernet"},{"key":"10.1016\/S0166-218X(02)00397-9_BIB20","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF02125456","article-title":"A tabu thresholding algorithm for arc crossing minimization in bipartite graphs","volume":"63","author":"Valls","year":"1996","journal-title":"Ann. Oper. Res"},{"key":"10.1016\/S0166-218X(02)00397-9_BIB21","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0377-2217(95)00356-8","article-title":"A branch and bound algorithm for arc crossing minimization in bipartite graphs","volume":"90","author":"Valls","year":"1996","journal-title":"Eur. J. Oper. Res"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02003979?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02003979?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:57:02Z","timestamp":1759060622000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02003979"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02003979"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00397-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Heuristics and meta-heuristics for 2-layer straight line crossing minimization","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(02)00397-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}