{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:31:35Z","timestamp":1649028695415},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T00:00:00Z","timestamp":1272326400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9326-6","type":"journal-article","created":{"date-parts":[[2010,4,26]],"date-time":"2010-04-26T18:53:28Z","timestamp":1272308008000},"page":"747-762","source":"Crossref","is-referenced-by-count":1,"title":["A rearrangement of adjacency matrix based approach for solving the crossing minimization problem"],"prefix":"10.1007","volume":"22","author":[{"given":"Neng","family":"Fan","sequence":"first","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,27]]},"reference":[{"key":"9326_CR1","doi-asserted-by":"crossref","first-page":"1882","DOI":"10.1016\/j.neucom.2006.02.018","volume":"69","author":"A Abdullah","year":"2006","unstructured":"Abdullah A, Hussain A (2006) A new biclustering technique based on crossing minimization. Neurocomputing 69:1882\u20131896","journal-title":"Neurocomputing"},{"key":"9326_CR2","unstructured":"Ahmad W, Khokhar A (2007) cHawk: an efficient biclustering algorithm based on bipartite graph crossing minimization. VLDB \u201907, Vienna, Austria"},{"key":"9326_CR3","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs"},{"key":"9326_CR4","volume-title":"The traveling salesman problem: a computational study","author":"DL Applegate","year":"2006","unstructured":"Applegate DL, Bixby RE, Chvatal V, Cook WJ (2006) The traveling salesman problem: a computational study. Princeton University Press, Princeton"},{"issue":"1","key":"9326_CR5","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1287\/ijoc.1090.0318","volume":"22","author":"C Buchheim","year":"2010","unstructured":"Buchheim C, Wiegele A, Zheng L (2010) Exact algorithms for the quadratic linear ordering problem. INFORMS J Comput 22(1):168\u2013177","journal-title":"INFORMS J Comput"},{"key":"9326_CR6","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/978-3-540-72845-0_10","volume":"4525","author":"O Cakiroglu","year":"2007","unstructured":"Cakiroglu O et al. (2007) Crossing minimization in weighted bipartite graphs. Lect Notes Comput Sci 4525:122\u2013135","journal-title":"Lect Notes Comput Sci"},{"key":"9326_CR7","unstructured":"ILOG CPLEX 11.0 (2007) Users Manual"},{"key":"9326_CR8","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1186\/1471-2105-9-458","volume":"9","author":"PA DiMaggio","year":"2008","unstructured":"DiMaggio PA, McAllister SR, Floudas CA, Feng XJ, Rabinowitz JD, Rabitz HA (2008) Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies. BMC Bioinform 9:458","journal-title":"BMC Bioinform"},{"issue":"3","key":"9326_CR9","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey MR, Johnson DS (1983) Crossing number is NP-complete. SIAM J Algebraic Discrete Methods 4(3):312\u2013316","journal-title":"SIAM J Algebraic Discrete Methods"},{"issue":"1","key":"9326_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M Junger","year":"1997","unstructured":"Junger M, Mutzel P (1997) 2-layer strainght line crossing minimization: performance of exact and heuristic algorithms. J Graph Algorithms and Appl 1(1):1\u201325","journal-title":"J Graph Algorithms and Appl"},{"issue":"1","key":"9326_CR11","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M Laguna","year":"1999","unstructured":"Laguna M, Marti R (1999) GRASP and path relinking for 2-layer strainght line crossing minimization. INFORMS J Comput 11(1):44\u201352","journal-title":"INFORMS J Comput"},{"key":"9326_CR12","volume-title":"Complexity issues in VLSI","author":"FT Leighton","year":"1983","unstructured":"Leighton FT (1983) Complexity issues in VLSI. MIT Press, Cambridge"},{"key":"9326_CR13","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1016\/S0166-218X(02)00397-9","volume":"127","author":"R Marti","year":"2003","unstructured":"Marti R, Laguna M (2003) Heuristics and meta-heuristics for 2-layer straight line crossing minimization. Discrete Appl Math 127:665\u2013678","journal-title":"Discrete Appl Math"},{"key":"9326_CR14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-45848-4_10","volume":"2265","author":"X Munoz","year":"2002","unstructured":"Munoz X, Unger W, Vrto I (2002) One sided crossing minimization is np-hard for sparse graphs. Lect Notes Comput Sci 2265:115\u2013123","journal-title":"Lect Notes Comput Sci"},{"key":"9326_CR15","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF02125456","volume":"63","author":"V Valls","year":"1996","unstructured":"Valls V, Marti R, Lino P (1996) A tabu thresholding algorithm for arc crossing minimization in bipartite graphs. Ann Oper Res 63:233\u2013251","journal-title":"Ann Oper Res"},{"key":"9326_CR16","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0377-2217(95)00356-8","volume":"90","author":"V Valls","year":"1996","unstructured":"Valls V, Marti R, Lino P (1996) A branch and bound algorithm for arc crossing minimization in bipartite graphs. Eur J Oper Res 90:303\u2013319","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9326-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9326-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9326-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:14Z","timestamp":1559276594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9326-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,27]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9326"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9326-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,27]]}}}