{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:53:35Z","timestamp":1761663215323},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037523"},{"type":"electronic","value":"9783319037530"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03753-0_1","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T14:16:54Z","timestamp":1386857814000},"page":"1-12","source":"Crossref","is-referenced-by-count":2,"title":["A Populated Iterated Greedy Algorithm with Inver-Over Operator for Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"M. Fatih","family":"Tasgetiren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ozge","family":"Buyukdagli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damla","family":"K\u0131z\u0131lay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Korhan","family":"Karabulut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/j.eswa.2010.07.006","volume":"38","author":"M. Albayrak","year":"2011","unstructured":"Albayrak, M., Allahverdi, N.: Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms. Expert Syst. Appl.\u00a038, 1313\u20131320 (2011)","journal-title":"Expert Syst. Appl."},{"key":"1_CR2","unstructured":"Albayrak, M.: Determination of route by means of Genetic Algorithms for printed circuit board driller machines. Master dissertation, p. 180, Selcuk University (2008)"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D. Applegate","year":"2003","unstructured":"Applegate, D., Cook, W., Rohe, A.: Chained Lin\u2013Kernighan for large traveling salesman problems. INFORMS J. Comput.\u00a015, 82\u201392 (2003)","journal-title":"INFORMS J. Comput."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. J. ACM\u00a045, 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"J.L. Bentley","year":"1992","unstructured":"Bentley, J.L.: Fast algorithm for geometric traveling salesman problems. ORSA J. Comput.\u00a04, 387\u2013441 (1992)","journal-title":"ORSA J. Comput."},{"key":"1_CR6","unstructured":"Bentley, J.L.: Experiments on traveling salesman heuristics. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 91\u201399 (1990)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Bouamama, S., Blum, C., Boukerram, A.: A population-based iterated greedy algorithm for the minimum weight vertex cover problem. Appl. Soft. Comput. J. (2012), doi:10.1016\/j.asoc.2012.02.013","DOI":"10.1016\/j.asoc.2012.02.013"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.physa.2006.04.052","volume":"371","author":"Y. Chen","year":"2006","unstructured":"Chen, Y., Zhang, P.: Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution. Physica A\u00a0371, 627\u2013632 (2006)","journal-title":"Physica A"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res.\u00a012, 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"1_CR10","series-title":"STUDFUZZ","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-39930-8_8","volume-title":"New Optimization Techniques in Engineering","author":"M. Clerc","year":"2004","unstructured":"Clerc, M.: Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: Onwubolu, G.C., Babu, B.V. (eds.) New Optimization Techniques in Engineering. STUDFUZZ, vol.\u00a0141, pp. 219\u2013239. Springer, Heidelberg (2004)"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1016\/j.neucom.2008.01.023","volume":"72","author":"J.C. Cr\u00e9put","year":"2009","unstructured":"Cr\u00e9put, J.C., Koukam, A.: A Memetic neural network for the Euclidean traveling salesman problem. Neurocomputing\u00a072, 1250\u20131264 (2009)","journal-title":"Neurocomputing"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colonies for the traveling salesman problem. BioSystems\u00a043, 73\u201381 (1997)","journal-title":"BioSystems"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2010.03.030","volume":"207","author":"L. Fanjul-Peyro","year":"2010","unstructured":"Fanjul-Peyro, L., Ruiz, R.: Iterated greedy local search methods for unrelated parallel machine scheduling. European Journal of Operational Research\u00a0207, 55\u201369 (2010)","journal-title":"European Journal of Operational Research"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(92)00033-I","volume":"51","author":"C.-N. Fiechter","year":"1994","unstructured":"Fiechter, C.-N.: A parallel Tabu search algorithm for large traveling salesman problems. Discrete Appl. Math.\u00a051, 243\u2013267 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"22","key":"1_CR15","doi-asserted-by":"publisher","first-page":"6479","DOI":"10.1080\/00207540701418960","volume":"46","author":"J.M. Framinan","year":"2008","unstructured":"Framinan, J.M., Leisten, R.: Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm. International Journal of Production Research\u00a046(22), 6479\u20136498 (2008)","journal-title":"International Journal of Production Research"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/11539902_91","volume-title":"Advances in Natural Computation","author":"Z.W. Geem","year":"2005","unstructured":"Geem, Z.W., Tseng, C.-L., Park, Y.-J.: Harmony search for generalized orienteering problem: best touring in China. In: Wang, L., Chen, K., S. Ong, Y. (eds.) ICNC 2005. LNCS, vol.\u00a03612, pp. 741\u2013750. Springer, Heidelberg (2005)"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M. Gendreau","year":"1992","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: New insertion and post optimization procedures for the traveling salesman problem. Oper. Res.\u00a040, 1086\u20131094 (1992)","journal-title":"Oper. Res."},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1016\/j.cor.2011.01.010","volume":"38","author":"G. Gerardo Minella","year":"2011","unstructured":"Gerardo Minella, G., Ruiz, R., Ciavotta, M.: Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems. Computers & Operations Research\u00a038, 1521\u20131533 (2011)","journal-title":"Computers & Operations Research"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/BFb0056922","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"G. Tao","year":"1998","unstructured":"Tao, G., Michalewicz, Z.: Inver-over operator for the TSP. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 803\u2013812. Springer, Heidelberg (1998)"},{"key":"1_CR20","volume-title":"The Traveling Salesman Problem and its Variations","author":"G. Gutin","year":"2002","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and its Variations. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K. Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research\u00a0126(1), 106\u2013130 (2000)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1_CR22","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1142\/S1465876301000350","volume":"2","author":"G.A. Jayalakshmi","year":"2001","unstructured":"Jayalakshmi, G.A., Sathiamoorthy, S., Rajaram, R.: A hybrid genetic algorithm \u2013 a new approach to solve traveling salesman problem. International Journal of Computational Engineering Science\u00a02(2), 339\u2013355 (2001)","journal-title":"International Journal of Computational Engineering Science"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0167-8191(05)80107-3","volume":"17","author":"C.S. Jeong","year":"1991","unstructured":"Jeong, C.S., Kim, M.H.: Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections. Parallel Comput.\u00a017, 221\u2013228 (1991)","journal-title":"Parallel Comput."},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.asoc.2010.03.008","volume":"10","author":"C. Kahraman","year":"2010","unstructured":"Kahraman, C., Engin, O., Kaya, I., Ozturk, R.E.: Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach. Applied Soft Computing\u00a010, 1293\u20131300 (2010)","journal-title":"Applied Soft Computing"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"7087","DOI":"10.1016\/j.eswa.2008.08.033","volume":"36","author":"K.-C. Kuo-Ching Ying","year":"2009","unstructured":"Kuo-Ching Ying, K.-C., Lin, S.-W., Huang, C.-Y.: Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic. Expert Systems with Applications\u00a036, 7087\u20137092 (2009)","journal-title":"Expert Systems with Applications"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.neucom.2004.02.006","volume":"62","author":"K.S. Leung","year":"2004","unstructured":"Leung, K.S., Jin, H.D., Xu, Z.B.: An expanding self-organizing neural network for the travelling salesman problem. Neurocomputing\u00a062, 267\u2013292 (2004)","journal-title":"Neurocomputing"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res.\u00a021, 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0020-0255(99)00124-3","volume":"122","author":"S.J. Louis","year":"2000","unstructured":"Louis, S.J., Li, G.: Case injected genetic algorithms for traveling salesman problems. Inform. Sci.\u00a0122, 201\u2013225 (2000)","journal-title":"Inform. Sci."},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ejor.2011.04.018","volume":"214","author":"M. Lozano","year":"2011","unstructured":"Lozano, M., Molina, D., Garcia-Martinez, C.: Iterated greedy for the maximum diversity problem. European Journal of Operational Research\u00a0214, 31\u201338 (2011)","journal-title":"European Journal of Operational Research"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Marinakis, Y., Marinaki, M., Dounias, G.: Honey bees mating optimization algorithm for the Euclidean traveling salesman problem. Inform. Sci. (2010), doi:10.1016\/j.ins.2010.06.032","DOI":"10.1016\/j.ins.2010.06.032"},{"key":"1_CR31","first-page":"297","volume":"13","author":"P. Merz","year":"2001","unstructured":"Merz, P., Freisleben, B.: Memetic algorithms for the traveling salesman problem. Complex Systems\u00a013, 297\u2013345 (2001)","journal-title":"Complex Systems"},{"issue":"32","key":"1_CR32","first-page":"29","volume":"3","author":"A. Misevicius","year":"2004","unstructured":"Misevicius, A.: Using iterated tabu search for the traveling salesman problem. Information Technology and Control\u00a03(32), 29\u201340 (2004)","journal-title":"Information Technology and Control"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res.\u00a024, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1_CR34","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore Jr., E.E., Ham, I.A.: Heuristic algorithm for the m-machine, n-node flow shop sequencing problem. OMEGA\u00a011(1), 91\u201395 (1983)","journal-title":"OMEGA"},{"key":"1_CR35","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.jss.2011.01.051","volume":"84","author":"Q. Qinma Kanga","year":"2011","unstructured":"Qinma Kanga, Q., Heb, H., Song, H.: Task assignment in heterogeneous computing systems using an effective iterated greedy algorithm. The Journal of Systems and Software\u00a084, 985\u2013992 (2011)","journal-title":"The Journal of Systems and Software"},{"key":"1_CR36","series-title":"STUDFUZZ","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-540-39930-8_22","volume-title":"New Optimization Techniques in Engineering","author":"G.C. Onwubolu","year":"2004","unstructured":"Onwubolu, G.C.: Optimizing CNC drilling machine operations: traveling salesman problem-differential evolution approach. In: Onwubolu, G.C., Babu, B.V. (eds.) New Optimization Techniques in Engineering. STUDFUZZ, vol.\u00a0141, pp. 537\u2013565. Springer, Heidelberg (2004)"},{"key":"1_CR37","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.cie.2008.03.003","volume":"55","author":"Q.-K. Pan","year":"2008","unstructured":"Pan, Q.-K., Fatih, T.M., Liang, Y.-C.: A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Computers & Industrial Engineering\u00a055, 795\u2013816 (2008)","journal-title":"Computers & Industrial Engineering"},{"key":"1_CR38","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1016\/j.camwa.2011.06.063","volume":"62","author":"Q.-K. Pan","year":"2011","unstructured":"Pan, Q.-K., Wang, Y.-T., Li, J.-Q., Gao, K.-Z.: Memetic Algorithm based on improved Inver\u2013Over operator and Lin\u2013Kernighan local search for the euclidean traveling salesman problem. Computers and Mathematics with Applications\u00a062, 2743\u20132754 (2011)","journal-title":"Computers and Mathematics with Applications"},{"key":"1_CR39","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M.W. Padberg","year":"1991","unstructured":"Padberg, M.W., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev.\u00a033, 60\u2013100 (1991)","journal-title":"SIAM Rev."},{"key":"1_CR40","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput.\u00a03, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"1_CR41","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.omega.2010.07.007","volume":"39","author":"I. Ribas","year":"2011","unstructured":"Ribas, I., Ramon Companys, R., Tort-Martorell, X.: An iterated greedy algorithm for the flowshop scheduling problem with blocking. Omega\u00a039, 293\u2013301 (2011)","journal-title":"Omega"},{"key":"1_CR42","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"D.J. Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput.\u00a06, 563\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1_CR43","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R. Ruiz","year":"2007","unstructured":"Ruiz, R., St\u00fctzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research\u00a0177(3), 2033\u20132049 (2007)","journal-title":"European Journal of Operational Research"},{"key":"1_CR44","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.ejor.2006.07.029","volume":"187","author":"R. Ruiz","year":"2008","unstructured":"Ruiz, R., St\u00fctzle, T.: An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research\u00a0187, 1143\u20131159 (2008)","journal-title":"European Journal of Operational Research"},{"key":"1_CR45","unstructured":"Schleuter, M.G.: Asparagos96 and the traveling salesman problem. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, pp. 171\u2013174. IEEE Press (1997)"},{"key":"1_CR46","unstructured":"Seo, D., Moon, B.: Voronoi quantized crossover for traveling salesman problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 544\u2013552 (2002)"},{"key":"1_CR47","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"X.H. Shi","year":"2007","unstructured":"Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, Q.X.: Particle swarm optimization-based algorithms for TSP and generalized TSP. Inform. Process. Lett.\u00a0103, 169\u2013176 (2007)","journal-title":"Inform. Process. Lett."},{"key":"1_CR48","unstructured":"St\u00fctzle, T., Hoos, H.: The MAX\u2013MIN ant system and local search for the traveling salesman problem. In: Proceedings of the IEEE International Conference on Evolutionary Computation, Indianapolis, Indiana, USA, pp. 308\u2013313 (1997)"},{"key":"1_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/BFb0056922","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"G. Tao","year":"1998","unstructured":"Tao, G., Michalewicz, Z.: Inver-over operator for the TSP. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 803\u2013812. Springer, Heidelberg (1998)"},{"key":"1_CR50","doi-asserted-by":"publisher","first-page":"3459","DOI":"10.1016\/j.ins.2011.04.018","volume":"181","author":"M. Tasgetiren","year":"2011","unstructured":"Tasgetiren, M., Fatih, P.Q.-K., Suganthan, P.N., Chen Angela, H.-L.: A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Information Sciences\u00a0181, 3459\u20133475 (2011)","journal-title":"Information Sciences"},{"key":"1_CR51","doi-asserted-by":"publisher","first-page":"1900","DOI":"10.1016\/j.cor.2008.06.007","volume":"36","author":"M. Tasgetiren","year":"2009","unstructured":"Tasgetiren, M., Fatih, P.Q.-K., Liang, Y.-C.: A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Computers & Operations Research\u00a036, 1900\u20131915 (2009)","journal-title":"Computers & Operations Research"},{"key":"1_CR52","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ins.2003.11.008","volume":"166","author":"C.F. Tsai","year":"2004","unstructured":"Tsai, C.F., Tsai, C.W., Tseng, C.C.: A new hybrid heuristic approach for solving large traveling salesman problem. Inform. Sci.\u00a0166, 67\u201381 (2004)","journal-title":"Inform. Sci."},{"key":"1_CR53","doi-asserted-by":"publisher","first-page":"2848","DOI":"10.1016\/j.eswa.2009.09.006","volume":"37","author":"K.-C. Ying","year":"2010","unstructured":"Ying, K.-C., Cheng, H.-M.: Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic. Expert Systems with Applications\u00a037, 2848\u20132852 (2010)","journal-title":"Expert Systems with Applications"}],"container-title":["Lecture Notes in Computer Science","Swarm, Evolutionary, and Memetic Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03753-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T07:42:36Z","timestamp":1558770156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03753-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037523","9783319037530"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03753-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}