{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:07:00Z","timestamp":1760706420505},"reference-count":26,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1016\/s0305-0548(96)00083-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"1175-1186","source":"Crossref","is-referenced-by-count":32,"title":["Arc crossing minimization in hierarchical digraphs with tabu search"],"prefix":"10.1016","volume":"24","author":[{"given":"Manuel","family":"Laguna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Mart\u00ed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vicente","family":"Valls","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00083-4_BIB1","series-title":"Algorithms for Drawing Graphs: an Annotated Bibliography","author":"Di Battista","year":"1994"},{"issue":"7","key":"10.1016\/S0305-0548(96)00083-4_BIB2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/TSMC.1977.4309760","article-title":"Crossing theory and hierarchy mapping","volume":"SMC-7","author":"Warfield","year":"1977","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"11","key":"10.1016\/S0305-0548(96)00083-4_BIB3","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":"SMC-10","author":"Carpano","year":"1980","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"3","key":"10.1016\/S0305-0548(96)00083-4_BIB4","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","article-title":"Crossing number is np-complete","volume":"4","author":"Garey","year":"1983","journal-title":"SIAM Journal of Algebraic and Discrete Methods"},{"key":"10.1016\/S0305-0548(96)00083-4_BIB5","article-title":"Quelques outils infographiques pou l'analyse structurale de systemes","author":"Delarche","year":"1979"},{"key":"10.1016\/S0305-0548(96)00083-4_BIB6","first-page":"89","article-title":"Heuristics for drawing 2-layered networks","volume":"21-A","author":"Eades","year":"1986","journal-title":"ARS Combinatoria"},{"key":"10.1016\/S0305-0548(96)00083-4_BIB7","article-title":"The median heuristic for drawing two-layered networks","author":"Eades","year":"1986"},{"key":"10.1016\/S0305-0548(96)00083-4_BIB8","article-title":"A tabu thresholding algorithm for arc crossing minimization in bipartite graphs","volume":"60","author":"Valls","year":"1995","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(96)00083-4_BIB9","series-title":"Proceedings of Metaheuristics International Conference","article-title":"An aggressive search procedure for the bipartite drawing problem","author":"Marti","year":"1995"},{"key":"10.1016\/S0305-0548(96)00083-4_BIB10","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","article-title":"Heuristics for integer programming using surrogate constraints","volume":"8","author":"Glover","year":"1977","journal-title":"Decision Science"},{"key":"10.1016\/S0305-0548(96)00083-4_BIB11","article-title":"The bipartite drawing problem","author":"Marti","year":"1995"},{"key":"10.1016\/S0305-0548(96)00083-4_BIB12","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":"International Journal of Computer Mathematics"},{"issue":"2","key":"10.1016\/S0305-0548(96)00083-4_BIB13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","article-title":"Methods for visual understanding of hierarchical system structures","volume":"SMC-11","author":"Sugiyama","year":"1981","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"1","key":"10.1016\/S0305-0548(96)00083-4_BIB14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/spe.4380170107","article-title":"A browser for directed graphs","volume":"17","author":"Rowe","year":"1987","journal-title":"Software \u2014 Practice and Experience"},{"issue":"11","key":"10.1016\/S0305-0548(96)00083-4_BIB15","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1002\/spe.4380181104","article-title":"DAG \u2014 A program that draws directed graphs","volume":"18","author":"Gansner","year":"1988","journal-title":"Software \u2014 Practice and Experience"},{"issue":"1","key":"10.1016\/S0305-0548(96)00083-4_BIB16","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","article-title":"Automatic graph drawing and readability of diagrams","volume":"18","author":"Tamassia","year":"1988","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"10.1016\/S0305-0548(96)00083-4_BIB17","series-title":"Proceedings of IEEE Workshop on Visual Languages (VL'89)","first-page":"13","article-title":"How to draw a directed graph","author":"Eades","year":"1989"},{"issue":"4","key":"10.1016\/S0305-0548(96)00083-4_BIB18","first-page":"424","article-title":"How to draw a directed graph","volume":"13","author":"Eades","year":"1990","journal-title":"Journal of Information Processing"},{"key":"10.1016\/S0305-0548(96)00083-4_BIB19","first-page":"743","article-title":"How to draw a graph","volume":"3","author":"Tutte","year":"1963"},{"key":"10.1016\/S0305-0548(96)00083-4_BIB20","series-title":"Proceedings of the Second Canadian Conference on Computational Geometry","first-page":"142","article-title":"An algorithm for drawing a hierarchical graph","author":"Eades","year":"1990"},{"issue":"3","key":"10.1016\/S0305-0548(96)00083-4_BIB21","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 Transactions on Software Engineering"},{"key":"10.1016\/S0305-0548(96)00083-4_BIB22","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":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/S0305-0548(96)00083-4_BIB23","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu Search \u2014 Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(96)00083-4_BIB24","article-title":"Tabu Search","volume":"41","author":"Glover","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(96)00083-4_BIB25","series-title":"Modern Heuristic Techniques for Combinatorial Problems","first-page":"70","article-title":"Tabu Search","author":"Glover","year":"1993"},{"issue":"1","key":"10.1016\/S0305-0548(96)00083-4_BIB26","first-page":"5","article-title":"A guide to implementing tabu search","volume":"4","author":"Laguna","year":"1994","journal-title":"Investigaci\u00f3n Operativa"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000834?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000834?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T20:59:30Z","timestamp":1556657970000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":26,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0305054896000834"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00083-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}