{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:08:19Z","timestamp":1760706499450},"reference-count":22,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0377-2217(97)00291-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"558-569","source":"Crossref","is-referenced-by-count":18,"title":["A tabu search algorithm for the bipartite drawing problem"],"prefix":"10.1016","volume":"106","author":[{"given":"Rafael","family":"Mart\u00ed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00291-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 Transactions on Systems, Man, and Cybernetics SMC"},{"issue":"5","key":"10.1016\/S0377-2217(97)00291-9_BIB2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Algorithms for drawing graphs: An annotated bibliography","volume":"4","author":"Di Battista","year":"1994","journal-title":"Computation Geometry: Theory and Applications"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB3","series-title":"Proceedings of IEEE Workshop on Visual Languages VL'89","first-page":"171","article-title":"Automatic layout of PERT diagrams with XPERT","author":"Di Battista","year":"1989"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB4","first-page":"89","article-title":"Heuristics for drawing 2-layered networks","volume":"21","author":"Eades","year":"1986","journal-title":"Ars Combinatoria"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB5","article-title":"An NP-complete crossing number problem for bipartite graphs","volume":"60","author":"Eades","year":"1985"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB6","article-title":"The median heuristic for drawing 2-layered networks","volume":"60","author":"Eades","year":"1986"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB7","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\/S0377-2217(97)00291-9_BIB8","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\/S0377-2217(97)00291-9_BIB9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search: Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB10","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu Search: Part 11","volume":"1","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB11","series-title":"Simple tabu thresholding in optimization","author":"Glover","year":"1992"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB12","series-title":"Tabu search","author":"Glover","year":"1997"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB13","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0196-6774(82)90026-8","article-title":"The NP-completeness column: An ongoing guide","volume":"3","author":"Johnson","year":"1982","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB14","doi-asserted-by":"crossref","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"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB15","article-title":"T\u00e9cnicas exactas y heuristicas en el dise\u00f1o autom\u00e1tico de redes de planificaci\u00f3n de proyectos","author":"Marti","year":"1993"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB16","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/32.67575","article-title":"Towards the automatic generation of software diagrams","volume":"SE 17","author":"Protsko","year":"1991","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB17","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 Transactions on Systems, Man, and Cybernetics SMC"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB18","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/31.34669","article-title":"Planar grid embedding in linear time","volume":"36","author":"Tamassia","year":"1989","journal-title":"IEEE Transactions on circuits and systems CAS"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB19","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"},{"key":"10.1016\/S0377-2217(97)00291-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":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00291-9_BIB21","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/TSMC.1977.4309760","article-title":"Crossing theory and hierarchy mapping","volume":"7","author":"Warfield","year":"1977","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics SMC"},{"issue":"1","key":"10.1016\/S0377-2217(97)00291-9_BIB22","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1111\/j.1749-6632.1970.tb56499.x","article-title":"A special crossing number for bipartite graphs: A research problem","volume":"175","author":"Watkins","year":"1970","journal-title":"Annals of the New York Academy of Sciences"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002919?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002919?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T12:56:02Z","timestamp":1556110562000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797002919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":22,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221797002919"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00291-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}