{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:53:03Z","timestamp":1760597583953},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,5,11]],"date-time":"2013-05-11T00:00:00Z","timestamp":1368230400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s12293-013-0115-5","type":"journal-article","created":{"date-parts":[[2013,5,10]],"date-time":"2013-05-10T00:49:49Z","timestamp":1368146989000},"page":"255-274","source":"Crossref","is-referenced-by-count":4,"title":["$$K$$ -page crossing number minimization problem: An evaluation of heuristics and its solution using GESAKP"],"prefix":"10.1007","volume":"5","author":[{"given":"Dharna","family":"Satsangi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamal","family":"Srivastava","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gursaran","family":"Srivastava","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,11]]},"reference":[{"key":"115_CR1","doi-asserted-by":"crossref","unstructured":"Lopez-Rodriguez D, Merida-Casermeiro E, Ortiz-de-Lazcano-Lobato JM, Galan-Marin G (2007) K-pages graph drawing with multivalued neural networks. In: ICANN\u201907 in Proceedings of the 17th international conference on artificial neural networks, pp 816\u2013825","DOI":"10.1007\/978-3-540-74695-9_84"},{"key":"115_CR2","doi-asserted-by":"crossref","unstructured":"Bansal R, Srivastava K, Shweta Varshney K, Sharma N (2008) An evolutionary algorithm for the 2-page crossing number problem. In: Proceedings of the IEEE congress on evolutionary computation (CEC), pp 1095\u20131102","DOI":"10.1109\/CEC.2008.4630933"},{"key":"115_CR3","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/12.46286","volume":"39","author":"S Masuda","year":"1990","unstructured":"Masuda S, Nakajima K, Kashiwabara T, Fujisawa T (1990) Crossing minimization in linear embeddings of graphs. IEEE Trans Comput 39:124\u2013127","journal-title":"IEEE Trans Comput"},{"key":"115_CR4","unstructured":"Poranen T, Erkki M, He H, Miller EH (2007) A simulated annealing algorithm for the 2-page crossing number problem. In: Proceedings of International Network Optimization Conference (INOC)"},{"key":"115_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10732-006-9000-4","volume":"13","author":"H He","year":"2007","unstructured":"He H, Sykora O, Makinen E (2007) Genetic algorithms for the 2-page book drawing problem of graphs. J Heuristics 13:77\u201393","journal-title":"J Heuristics"},{"key":"115_CR6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.jpdc.2006.08.002","volume":"67","author":"H He","year":"2007","unstructured":"He H, S\u00fdkora O, Salagean A, Makinen E (2007) Parallelisation of genetic algorithms for the 2-page crossing number problem. J Parallel Distrib Comput 67:229\u2013241","journal-title":"J Parallel Distrib Comput"},{"issue":"6","key":"115_CR7","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1109\/TNN.2006.881486","volume":"17","author":"H He","year":"2006","unstructured":"He H, Sykora O, Makinen E (2006) An improved neural network model for the two-page crossing number problem. IEEE Trans Neural Netw 17(6):1642\u20131646","journal-title":"IEEE Trans Neural Netw"},{"key":"115_CR8","doi-asserted-by":"crossref","unstructured":"Chung FRK, Leighton FT, Rosenberg AL (1987) Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J Algebraic Discrete Methods 8(1):33\u201358","DOI":"10.1137\/0608002"},{"issue":"8","key":"115_CR9","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1080\/00207160802524747","volume":"87","author":"H He","year":"2010","unstructured":"He H, Salagean A, Makinen E (2010) One- and two-page crossing numbers for some types of graphs. Int J Comput Math 87(8):1667\u20131679","journal-title":"Int J Comput Math"},{"key":"115_CR10","unstructured":"Shahrokhi F, Sykora O, Szekely LA, Vrto I (1997) Crossing numbers: bounds and applications. In: Barany I, Boroczky K (eds) Intuitive geometry. Bolyai society mathematical studies, vol 6. Akademia Kiado, Budapest, pp 179\u2013206"},{"issue":"1\u20133","key":"115_CR11","first-page":"93","volume":"122","author":"R Cimikowski","year":"2001","unstructured":"Cimikowski R (2001) Algorithms for the fixed linear crossing number problem. Discrete Appl Math 122(1\u20133):93\u2013115","journal-title":"Discrete Appl Math"},{"key":"115_CR12","doi-asserted-by":"crossref","unstructured":"Games RA (1986) Optimal book embeddings of the FFT, Benes, and barrel shifter networks. Algorithmica 1:233\u2013250","DOI":"10.1007\/BF01840445"},{"issue":"2","key":"115_CR13","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1109\/72.363466","volume":"6","author":"PPC Yip","year":"1995","unstructured":"Yip PPC, Pao Yoh-Han (1995) Combinatorial optimization with use of guided evolutionary simulated annealing. IEEE Trans Neural Netw 6(2):290\u2013295","journal-title":"IEEE Trans Neural Netw"},{"key":"115_CR14","doi-asserted-by":"crossref","unstructured":"Sharma R, Srivastava K (2007) A level structure based hybrid evolutionary algorithm for the edge bisection problem. In: International conference on computational intelligence and multimedia applications (ICCIMA 2007), vol 2, pp 146\u2013150","DOI":"10.1109\/ICCIMA.2007.195"},{"issue":"2","key":"115_CR15","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01989746","volume":"33","author":"O Sykora","year":"1993","unstructured":"Sykora O, Vrto I (1993) On crossing numbers of hypercubes and cube connected cycles. BIT Numer Math 33(2):232\u2013237","journal-title":"BIT Numer Math"},{"issue":"1\u20133","key":"115_CR16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0012-365X(02)00450-8","volume":"260","author":"Y Guan","year":"2003","unstructured":"Guan Y, Williams KL (2003) Profile minimization on triangulated triangles. Discrete Math 260(1\u20133):69\u201376","journal-title":"Discrete Math"},{"key":"115_CR17","doi-asserted-by":"crossref","unstructured":"Hasunuma T, Shibata Y (1997) Embedding de Brujin, Kautz and Shuffle-exchange networks in books. Discrete Appl Math 78(1): 103\u2013116","DOI":"10.1016\/S0166-218X(97)00009-7"},{"key":"115_CR18","unstructured":"GDToolkit. http:\/\/www.dia.uniroma3.it $$\\sim $$ gdt\/"},{"key":"115_CR19","volume-title":"Statistics for management","author":"RI Levin","year":"2001","unstructured":"Levin RI, Rubin DS (2001) Statistics for management. Pearson, San Francisco"},{"key":"115_CR20","unstructured":"SYSTAT 9, Statistics I (1999) by SPSS Inc., USA"},{"key":"115_CR21","doi-asserted-by":"crossref","unstructured":"Cimikowski R, Mumey B (2007) Approximating the fixed linear crossing number. Discrete Appl Math 155(17)","DOI":"10.1016\/j.dam.2007.05.009"},{"key":"115_CR22","doi-asserted-by":"crossref","unstructured":"Kapoor N, Russell M, Stojmenovic I (2002) A genetic algorithm for finding the pagenumber of interconnection networks. J Parallel Distrib Comput 62:267\u2013283","DOI":"10.1006\/jpdc.2001.1789"},{"key":"115_CR23","doi-asserted-by":"crossref","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","DOI":"10.1126\/science.220.4598.671"},{"key":"115_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer, Boston"},{"key":"115_CR25","volume-title":"Handbook of metaheuristics","author":"M Gendreau","year":"2003","unstructured":"Gendreau M, Potvin J-Y (2003) Handbook of metaheuristics. Springer, Berlin"},{"key":"115_CR26","doi-asserted-by":"crossref","unstructured":"Satsangi D, Srivastava K, Gursaran (2011) A hybrid evolutionary algorithm for the page number minimization problem. In: Trends in computer science, engineering and information technology (CCSEIT), vol 204. Springer, Berlin, pp 463\u2013475","DOI":"10.1007\/978-3-642-24043-0_47"},{"key":"115_CR27","doi-asserted-by":"crossref","unstructured":"Enomoto H, Nakamigawa T, Ota K (1997) On the pagenumber of complete bipartite graphs. J Comb theory 71(1):111\u2013120","DOI":"10.1006\/jctb.1997.1773"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-013-0115-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-013-0115-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-013-0115-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T16:36:38Z","timestamp":1563035798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-013-0115-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,11]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["115"],"URL":"https:\/\/doi.org\/10.1007\/s12293-013-0115-5","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,11]]}}}