{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:13Z","timestamp":1759847773610,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,1,9]],"date-time":"2009-01-09T00:00:00Z","timestamp":1231459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,1,9]]},"DOI":"10.1145\/1527125.1527134","type":"proceedings-article","created":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T13:37:11Z","timestamp":1239802631000},"page":"59-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Computing single source shortest paths using single-objective fitness"],"prefix":"10.1145","author":[{"given":"Surender","family":"Baswana","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Kanpur, Kanpur, India"}]},{"given":"Somenath","family":"Biswas","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Kanpur"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[{"name":"International Computer Science Institute, Berkeley, CA, USA"}]},{"given":"Piyush P.","family":"Kurur","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Kanpur, Kanpur, India"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2009,1,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"Alon N.","year":"2000","unstructured":"N. Alon and J. H. Spencer . The Probabilistic Method . Wiley , 2 nd edition, 2000 . N. Alon and J. H. Spencer. The Probabilistic Method. Wiley, 2nd edition, 2000.","edition":"2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1137521"},{"key":"e_1_3_2_1_3_1","first-page":"269","volume-title":"Numerische Mathematik","author":"Dijkstra E. W.","year":"1959","unstructured":"E. W. Dijkstra . A note on two problems in connexion with graphs . In Numerische Mathematik , volume 1 , pages 269 -- 271 . Mathematisch Centrum, Amsterdam, The Netherlands , 1959 . E. W. Dijkstra. A note on two problems in connexion with graphs. In Numerische Mathematik, volume 1, pages 269--271. Mathematisch Centrum, Amsterdam, The Netherlands, 1959."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424704"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389274"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/975277"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.10.006"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646517.694055"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-006-0014-2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.7551\/mitpress\/2887.003.0018","volume-title":"Evolu-tionary Programming","author":"Michalewicz Z.","year":"1995","unstructured":"Z. Michalewicz . A survey of constraint handling techniques in evolutionary computation methods . In Evolu-tionary Programming , pages 135 -- 155 , 1995 . Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In Evolu-tionary Programming, pages 135--155, 1995."},{"key":"e_1_3_2_1_13_1","first-page":"15","volume-title":"Proc. 2nd Interna-tional Conference Parallel Problem Solving from Nature (PPSN II)","author":"M\u00fchlenbein H.","year":"1992","unstructured":"H. M\u00fchlenbein . How genetic algorithms really work: mutation and hillclimbing . In Proc. 2nd Interna-tional Conference Parallel Problem Solving from Nature (PPSN II) , pages 15 -- 26 , 1992 . H. M\u00fchlenbein. How genetic algorithms really work: mutation and hillclimbing. In Proc. 2nd Interna-tional Conference Parallel Problem Solving from Nature (PPSN II), pages 15--26, 1992."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1996.4.2.195"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_71"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_4"}],"event":{"name":"FOGA '09: Foundations of Genetic Algorithms X","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Orlando Florida USA","acronym":"FOGA '09"},"container-title":["Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1527125.1527134","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1527125.1527134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:52Z","timestamp":1750253392000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1527125.1527134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,9]]},"references-count":18,"alternative-id":["10.1145\/1527125.1527134","10.1145\/1527125"],"URL":"https:\/\/doi.org\/10.1145\/1527125.1527134","relation":{},"subject":[],"published":{"date-parts":[[2009,1,9]]},"assertion":[{"value":"2009-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}