{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:46Z","timestamp":1720640806192},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministry of Economy and Competitiveness","doi-asserted-by":"publisher","award":["TIN2015-66863-C2-1-R"],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1016\/j.endm.2018.03.003","type":"journal-article","created":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T15:23:29Z","timestamp":1523546609000},"page":"15-22","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["ILP-Based Reduced Variable Neighborhood Search for Large-Scale Minimum Common String Partition"],"prefix":"10.1016","volume":"66","author":[{"given":"Christian","family":"Blum","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2018.03.003_br0010","series-title":"Proc. of HM 20104\u20139th International Workshop on Hybrid Metaheuristics","first-page":"154","article-title":"Iterative probabilistic tree search for the minimum common string partition problem","volume":"vol. 8457","author":"Blum","year":"2014"},{"key":"10.1016\/j.endm.2018.03.003_br0020","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/j.ejor.2014.10.049","article-title":"Mathematical programming strategies for solving the minimum common string partition problem","volume":"242","author":"Blum","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.endm.2018.03.003_br0030","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.cor.2015.10.014","article-title":"Construct, merge, solve & adapt: A new general algorithm for combinatorial optimization","volume":"68","author":"Blum","year":"2016","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.endm.2018.03.003_br0040","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s11590-015-0921-4","article-title":"Computational performance evaluation of two integer linear programming models for the minimum common string partition problem","volume":"10","author":"Blum","year":"2016","journal-title":"Optimization Letters"},{"key":"10.1016\/j.endm.2018.03.003_br0050","series-title":"Proc. of the Asia Pacific Bioinformatics Conference 2005","first-page":"363","article-title":"Computing the assignment of orthologous genes via genome rearrangement","author":"Chen","year":"2005"},{"key":"10.1016\/j.endm.2018.03.003_br0060","series-title":"Proc. of ICSI 2013\u20134th International Conference on Advances in Swarm Intelligence","first-page":"306","article-title":"Solving the minimum common string partition problem with the help of ants","volume":"vol. 7928","author":"Ferdous","year":"2013"},{"key":"10.1016\/j.endm.2018.03.003_br0070","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0130266","article-title":"An integer programming formulation of the minimum common string partition problem","volume":"10","author":"Ferdous","year":"2015","journal-title":"PloS one"},{"key":"10.1016\/j.endm.2018.03.003_br0080","series-title":"Proc. of ISAAC 2004\u201315th International Symposium on Algorithms and Computation","first-page":"484","article-title":"Minimum common string partition problem: Hardness and approximations","volume":"vol. 3341","author":"Goldstein","year":"2005"},{"key":"10.1016\/j.endm.2018.03.003_br0090","series-title":"Proc. of ISBRA 2007 \u2013 Third International Symposium on Bioinformatics Research and Applications","first-page":"441","article-title":"A novel greedy algorithm for the minimum common string partition problem","volume":"vol. 4463","author":"He","year":"2007"},{"key":"10.1016\/j.endm.2018.03.003_br0100","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Computers & Operations Research"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065318300490?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065318300490?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T14:24:19Z","timestamp":1534947859000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065318300490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":10,"alternative-id":["S1571065318300490"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2018.03.003","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2018,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"ILP-Based Reduced Variable Neighborhood Search for Large-Scale Minimum Common String Partition","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.endm.2018.03.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}