{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T03:41:33Z","timestamp":1768102893805,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T00:00:00Z","timestamp":1562976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100008952","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}],"id":[{"id":"10.13039\/501100008952","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ARC","award":["DP160102401, DP190103894"],"award-info":[{"award-number":["DP160102401, DP190103894"]}]},{"DOI":"10.13039\/501100000921","name":"European Cooperation in Science and Technology","doi-asserted-by":"publisher","award":["CA15140"],"award-info":[{"award-number":["CA15140"]}],"id":[{"id":"10.13039\/501100000921","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,13]]},"DOI":"10.1145\/3321707.3321731","type":"proceedings-article","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T13:48:04Z","timestamp":1562161684000},"page":"233-241","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Fast re-optimization via structural diversity"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique, CNRS, LIX, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, CNRS, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"University of Adelaide, School of Computer Science, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Theory of Randomized Search Heuristics: Foundations and Recent Developments","author":"Auger Anne","unstructured":"Anne Auger and Benjamin Doerr . 2011. Theory of Randomized Search Heuristics: Foundations and Recent Developments . Vol. 1 . World Scientific . Anne Auger and Benjamin Doerr. 2011. Theory of Randomized Search Heuristics: Foundations and Recent Developments. Vol. 1. World Scientific."},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN'10) (Lecture Notes in Computer Science)","author":"B\u00f6ttcher S\u00fcntje","unstructured":"S\u00fcntje B\u00f6ttcher , Benjamin Doerr , and Frank Neumann . 2010. Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem . In Proc. of Parallel Problem Solving from Nature (PPSN'10) (Lecture Notes in Computer Science) , Vol. 6238 . Springer , 1--10. S\u00fcntje B\u00f6ttcher, Benjamin Doerr, and Frank Neumann. 2010. Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. In Proc. of Parallel Problem Solving from Nature (PPSN'10) (Lecture Notes in Computer Science), Vol. 6238. Springer, 1--10."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Raymond Chiong Thomas Weise and Zbigniew Michalewicz (Eds.). 2012. Variants of Evolutionary Algorithms for Real-World Applications. Springer.   Raymond Chiong Thomas Weise and Zbigniew Michalewicz (Eds.). 2012. Variants of Evolutionary Algorithms for Real-World Applications. Springer.","DOI":"10.1007\/978-3-642-23424-8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205563"},{"key":"e_1_3_2_1_5_1","volume-title":"Optimization for Engineering Design - Algorithms and Examples","author":"Deb Kalyanmoy","unstructured":"Kalyanmoy Deb . 2012. Optimization for Engineering Design - Algorithms and Examples , Second Edition. PHI Learning Private Limited . http:\/\/phindia.com\/bookdetails\/optimization_for_engineering_design_-algorithms_and_examples_by-deb_kalyanmoy_-isbn-978-81-203-4678-9 Kalyanmoy Deb. 2012. Optimization for Engineering Design - Algorithms and Examples, Second Edition. PHI Learning Private Limited. http:\/\/phindia.com\/bookdetails\/optimization_for_engineering_design_-algorithms_and_examples_by-deb_kalyanmoy_-isbn-978-81-203-4678-9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77449-7_1"},{"key":"e_1_3_2_1_7_1","volume-title":"Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. CoRR abs\/1801.06733","author":"Doerr Benjamin","year":"2018","unstructured":"Benjamin Doerr . 2018. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. CoRR abs\/1801.06733 ( 2018 ). arXiv:1801.06733 http:\/\/arxiv.org\/abs\/1801.06733 Benjamin Doerr. 2018. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. CoRR abs\/1801.06733 (2018). arXiv:1801.06733 http:\/\/arxiv.org\/abs\/1801.06733"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424797"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00047"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.10.035"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460245"},{"key":"e_1_3_2_1_12_1","volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"Jansen Thomas","unstructured":"Thomas Jansen . 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective . Springer . Thomas Jansen. 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-013-0991-0"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.06.035"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-006-9004-x"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"key":"e_1_3_2_1_17_1","volume-title":"Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity","author":"Neumann Frank","unstructured":"Frank Neumann and Carsten Witt . 2010. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity ( 1 st ed.). Springer . Frank Neumann and Carsten Witt. 2010. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity (1st ed.). Springer.","edition":"1"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. of International Joint Conference on Artificial Intelligence (IJCAI'15)","author":"Neumann Frank","year":"2015","unstructured":"Frank Neumann and Carsten Witt . 2015 . On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling . In Proc. of International Joint Conference on Artificial Intelligence (IJCAI'15) . AAAI Press, 3742--3748. Frank Neumann and Carsten Witt. 2015. On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling. In Proc. of International Joint Conference on Artificial Intelligence (IJCAI'15). AAAI Press, 3742--3748."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2180533"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754700"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.871251"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2016.09.002"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1527125.1527130"},{"key":"e_1_3_2_1_24_1","volume-title":"Handbook of Optimization - From Classical to Modern Approach, Ivan Zelinka, V\u00e1clav Sn\u00e1sel","author":"Richter Hendrik","unstructured":"Hendrik Richter and Shengxiang Yang . 2013. Dynamic Optimization Using Analytic and Evolutionary Approaches: A Comparative Review . In Handbook of Optimization - From Classical to Modern Approach, Ivan Zelinka, V\u00e1clav Sn\u00e1sel , and Ajith Abraham (Eds.). Intelligent Systems Reference Library, Vol . 38. Springer , 1--28. Hendrik Richter and Shengxiang Yang. 2013. Dynamic Optimization Using Analytic and Evolutionary Approaches: A Comparative Review. In Handbook of Optimization - From Classical to Modern Approach, Ivan Zelinka, V\u00e1clav Sn\u00e1sel, and Ajith Abraham (Eds.). Intelligent Systems Reference Library, Vol. 38. Springer, 1--28."},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science)","author":"Roostapour Vahid","unstructured":"Vahid Roostapour , Aneta Neumann , and Frank Neumann . 2018. On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem . In Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science) , Vol. 11101 . Springer , 158--169. Vahid Roostapour, Aneta Neumann, and Frank Neumann. 2018. On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem. In Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science), Vol. 11101. Springer, 158--169."},{"key":"e_1_3_2_1_26_1","volume-title":"Pareto Optimization for Subset Selection with Dynamic Cost Constraints. CoRR abs\/1811.07806","author":"Roostapour Vahid","year":"2018","unstructured":"Vahid Roostapour , Aneta Neumann , Frank Neumann , and Tobias Friedrich . 2018. Pareto Optimization for Subset Selection with Dynamic Cost Constraints. CoRR abs\/1811.07806 ( 2018 ). arXiv:1811.07806 http:\/\/arxiv.org\/abs\/1811.07806 Conference version appears at AAAI 2019. Vahid Roostapour, Aneta Neumann, Frank Neumann, and Tobias Friedrich. 2018. Pareto Optimization for Subset Selection with Dynamic Cost Constraints. CoRR abs\/1811.07806 (2018). arXiv:1811.07806 http:\/\/arxiv.org\/abs\/1811.07806 Conference version appears at AAAI 2019."},{"key":"e_1_3_2_1_27_1","volume-title":"Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. CoRR abs\/1806.08547","author":"Roostapour Vahid","year":"2018","unstructured":"Vahid Roostapour , Mojgan Pourhassan , and Frank Neumann . 2018. Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. CoRR abs\/1806.08547 ( 2018 ). arXiv:1806.08547 http:\/\/arxiv.org\/abs\/1806.08547 Vahid Roostapour, Mojgan Pourhassan, and Frank Neumann. 2018. Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. CoRR abs\/1806.08547 (2018). arXiv:1806.08547 http:\/\/arxiv.org\/abs\/1806.08547"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.036"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0274-8"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205580"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071270"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205595"},{"key":"e_1_3_2_1_33_1","volume-title":"Proc. of Automata, Languages and Programming (ICALP'01) (Lecture Notes in Computer Science)","author":"Wegener Ingo","unstructured":"Ingo Wegener . 2001. Theoretical Aspects of Evolutionary Algorithms . In Proc. of Automata, Languages and Programming (ICALP'01) (Lecture Notes in Computer Science) , Vol. 2076 . Springer , 64--78. Ingo Wegener. 2001. Theoretical Aspects of Evolutionary Algorithms. In Proc. of Automata, Languages and Programming (ICALP'01) (Lecture Notes in Computer Science), Vol. 2076. Springer, 64--78."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598237"},{"key":"e_1_3_2_1_35_1","volume-title":"Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovi\u010d on the Occasion of His 60th Birthday (Lecture Notes in Computer Science)","author":"Zych-Pawlewicz Anna","unstructured":"Anna Zych-Pawlewicz . 2018. Reoptimization of NP-Hard Problems . In Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovi\u010d on the Occasion of His 60th Birthday (Lecture Notes in Computer Science) , Vol. 11011 . Springer , 477--494. Anna Zych-Pawlewicz. 2018. Reoptimization of NP-Hard Problems. In Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovi\u010d on the Occasion of His 60th Birthday (Lecture Notes in Computer Science), Vol. 11011. Springer, 477--494."}],"event":{"name":"GECCO '19: Genetic and Evolutionary Computation Conference","location":"Prague Czech Republic","acronym":"GECCO '19","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321731","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3321707.3321731","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:19Z","timestamp":1750204399000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,13]]},"references-count":35,"alternative-id":["10.1145\/3321707.3321731","10.1145\/3321707"],"URL":"https:\/\/doi.org\/10.1145\/3321707.3321731","relation":{},"subject":[],"published":{"date-parts":[[2019,7,13]]},"assertion":[{"value":"2019-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}