{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T20:18:02Z","timestamp":1720297082518},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["Comunidad de Madrid","TIN2015-65460-C02","S2013\/ICE-2894"],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1016\/j.cor.2017.10.011","type":"journal-article","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T07:52:23Z","timestamp":1509522743000},"page":"1-12","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":18,"special_numbering":"C","title":["Tabu search for the dynamic Bipartite Drawing Problem"],"prefix":"10.1016","volume":"91","author":[{"given":"Rafael","family":"Mart\u00ed","sequence":"first","affiliation":[]},{"given":"Anna","family":"Mart\u00ednez-Gavara","sequence":"additional","affiliation":[]},{"given":"Jes\u00fas","family":"S\u00e1nchez-Oro","sequence":"additional","affiliation":[]},{"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2017.10.011_bib0001","unstructured":"Antonellis, I., H.G. Molina, and C. Chao (2008). Simrank++: query rewriting through link analysis of the click graph. 1(1):408\u2013421."},{"issue":"1","key":"10.1016\/j.cor.2017.10.011_bib0002","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1111\/cgf.12791","article-title":"A taxonomy and survey of dynamic graph visualization","volume":"36","author":"Beck","year":"2016","journal-title":"Comput. Graphics Forum"},{"key":"10.1016\/j.cor.2017.10.011_bib0003","series-title":"In: Drawing Graphs. Methods and Models","first-page":"228","article-title":"Dynamic graph drawing","volume":"2025","author":"Branke","year":"2001"},{"issue":"12","key":"10.1016\/j.cor.2017.10.011_bib0004","doi-asserted-by":"crossref","first-page":"2440","DOI":"10.1109\/TVCG.2011.193","article-title":"Evaluation of traditional, orthogonal, and radial tree diagrams by an eye tracking study","volume":"17","author":"Burch","year":"2011","journal-title":"IEEE Trans. Visualiz. Comput. Graphics"},{"issue":"3","key":"10.1016\/j.cor.2017.10.011_bib0005","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1111\/cgf.13185","article-title":"Visualizing a sequence of a thousand graphs (or Even More)","volume":"36","author":"Burch","year":"2017","journal-title":"Comput. Graphics Forum"},{"issue":"11","key":"10.1016\/j.cor.2017.10.011_bib0006","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. Syst. Man Cybern."},{"key":"10.1016\/j.cor.2017.10.011_bib0007","series-title":"Graph drawing: algorithms for the visualization of graphs","author":"Di Battista","year":"1999"},{"key":"10.1016\/j.cor.2017.10.011_bib0008","series-title":"10th International Symposium on Graph Drawing GD 2002","first-page":"23","article-title":"Graphs, they are changing","volume":"2528","author":"Diehl","year":"2002"},{"key":"10.1016\/j.cor.2017.10.011_bib0009","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ins.2014.10.010","article-title":"GRASP with exterior path relinking for differential dispersion minimization","volume":"296","author":"Duarte","year":"2015","journal-title":"Inf. Sci."},{"key":"10.1016\/j.cor.2017.10.011_bib0010","first-page":"24","article-title":"Preserving the mental map of a diagram","volume":"91","author":"Eades","year":"1991","journal-title":"Proc. Compugraphics."},{"issue":"3","key":"10.1016\/j.cor.2017.10.011_bib0011","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s11235-010-9289-z","article-title":"GRASP: basic components and enhancements","volume":"46","author":"Festa","year":"2011","journal-title":"Telecommun. Syst."},{"issue":"3","key":"10.1016\/j.cor.2017.10.011_bib0012","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 J. Algebraic Discrete Methods"},{"issue":"3-4","key":"10.1016\/j.cor.2017.10.011_bib0013","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1177\/1473871612455749","article-title":"A survey of two-dimensional graph layout techniques for information visualization","volume":"12","author":"Gibson","year":"2012","journal-title":"Inf. Visualiz."},{"key":"10.1016\/j.cor.2017.10.011_bib0014","series-title":"Tabu Search","author":"Glover","year":"1997"},{"key":"10.1016\/j.cor.2017.10.011_bib0015","series-title":"12th International Symposium on Graph Drawing, GD 2004","first-page":"228","article-title":"Dynamic graph drawing of sequences of orthogonal and hierarchical graphs","volume":"3383","author":"G\u00f6rg","year":"2004"},{"issue":"6","key":"10.1016\/j.cor.2017.10.011_bib0016","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","article-title":"A cutting plane algorithm for the linear ordering problem","volume":"32","author":"Gr\u00f6tschel","year":"1984","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2017.10.011_bib0017","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","article-title":"2-Layer straightline crossing minimization: performance of exact and heuristic algorithms","volume":"1","author":"J\u00fcnger","year":"1997","journal-title":"J. Graph Algorithms Appl."},{"issue":"5","key":"10.1016\/j.cor.2017.10.011_bib0018","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1109\/TVCG.2006.193","article-title":"Visual exploration of complex time-varying graphs","volume":"12","author":"Kumar","year":"2006","journal-title":"IEEE Trans. Visualiz. Comput. Graphics"},{"key":"10.1016\/j.cor.2017.10.011_bib0019","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."},{"key":"10.1016\/j.cor.2017.10.011_bib0020","doi-asserted-by":"crossref","first-page":"1287","DOI":"10.1016\/S0305-0548(00)00040-X","article-title":"Incremental Bipartite Drawing Problem","volume":"28","author":"Mart\u00ed","year":"2001","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"10.1016\/j.cor.2017.10.011_bib0021","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1080\/07408170108936883","article-title":"Arc crossing minimization in graphs with GRASP","volume":"33","author":"Mart\u00ed","year":"2001","journal-title":"IIE Trans."},{"key":"10.1016\/j.cor.2017.10.011_bib0022","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1006\/jvlc.2002.0232","article-title":"Metrics for graph drawing aesthetics","volume":"13","author":"Purchase","year":"2002","journal-title":"J. Visual Lang. Comput."},{"key":"10.1016\/j.cor.2017.10.011_bib0023","first-page":"219","article-title":"Greedy Randomized Adaptive Search Procedures","author":"Resende","year":"2001"},{"key":"10.1016\/j.cor.2017.10.011_bib0024","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","article-title":"GRASP and path relinking for the max-min diversity problem","volume":"37","author":"Resende","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2017.10.011_bib0025","series-title":"20th International Symposium on Graph Drawing","article-title":"Clustering, visualizing, and navigating for large dynamic graphs","author":"Sallaberry","year":"2012"},{"key":"10.1016\/j.cor.2017.10.011_bib0026","first-page":"6","article-title":"Heuristics, experimental subjects, and treatment evaluation in bigraph crossing minimization","author":"Stallmann","year":"2001","journal-title":"J. Exp. Algorithmics"},{"issue":"8","key":"10.1016\/j.cor.2017.10.011_bib0027","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1109\/TVCG.2013.263","article-title":"Dynamic network visualization with extended massive sequence views","volume":"20","author":"Van der Elzen","year":"2013","journal-title":"IEEE Trans. Visualiz. Comp. Graphics."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054817302745?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054817302745?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T02:26:03Z","timestamp":1536287163000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054817302745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":27,"alternative-id":["S0305054817302745"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2017.10.011","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2018,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Tabu search for the dynamic Bipartite Drawing Problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2017.10.011","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}