-
1Report
-
2Conference
المؤلفون: Sleegers, Joeri, Thomson, Sarah L, Van Den Berg, Daan
المساهمون: Bäck, Thomas, van Stein, Bas, Wagner, Christian, Garibaldi, Jonathan, Lam, H.K., Cottrell, Marie, Doctor, Faiyaz, Filipe, Joaquim, Warwick, Kevin, Kacprzyk, Janusz, Independent, Computing Science and Mathematics - Division, Vrije University Amsterdam, orcid:0000-0001-6971-7817
مصطلحات موضوعية: Exact Algorithms, Instance Hardness, Evolutionary Algorithms, Phase Transition
وصف الملف: application/pdf
Relation: Sleegers J, Thomson SL & Van Den Berg D (2022) Universally Hard Hamiltonian Cycle Problem Instances. In: Bäck T, van Stein B, Wagner C, Garibaldi J, Lam H, Cottrell M, Doctor F, Filipe J, Warwick K & Kacprzyk J (eds.) Proceedings of the 14th International Joint Conference on Computational Intelligence - ECTA . ECTA 2022 : 14th International Conference on Evolutionary Computation Theory and Applications, Valletta, Malta, 24.10.2022-26.11.2022. SCITEPRESS – Science and Technology Publications, pp. 105-111. https://doi.org/10.5220/0011531900003332; http://hdl.handle.net/1893/34655; 1852810; http://dspace.stir.ac.uk/retrieve/72a60936-a72f-474d-98cb-d1cf33b31f7d/2022Sleegersetal-UniversallyHardHamiltonianCycleProblemInstances.pdf
-
3Academic Journal
المؤلفون: Koppenhol, Levi, Brouwer, Nielis, Dijkzeul, Danny, Pijning, Iris, Sleegers, Joeri, Van Den Berg, Daan
المصدر: Koppenhol , L , Brouwer , N , Dijkzeul , D , Pijning , I , Sleegers , J & Van Den Berg , D 2022 , Exactly characterizable parameter settings in a crossoverless evolutionary algorithm . in GECCO '22 : Proceedings of the Genetic and Evolutionary Computation Conference Companion . Association for Computing Machinery, Inc , pp. 1640-1649 , 2022 Genetic and Evolutionary Computation Conference, GECCO 2022 , Virtual, Online , United States , 9/07/22 . https://doi.org/10.1145/3520304.3533968
مصطلحات موضوعية: approximation algorithms, characterization, evolutionary algorithms, exact algorithms, metaheuristics, parameterization, plant propagation algorithm, PTAS, traveling salesman problem
وصف الملف: application/pdf
Relation: urn:ISBN:9781450392686
الاتاحة: https://research.vu.nl/en/publications/9662c242-f226-4cd3-957c-6d24d06e0dbc
https://doi.org/10.1145/3520304.3533968
https://hdl.handle.net/1871.1/9662c242-f226-4cd3-957c-6d24d06e0dbc
https://research.vu.nl/ws/files/218447585/Exactly_characterizable_parameter_settings_in_a_crossoverless_evolutionary_algorithm.pdf
http://www.scopus.com/inward/record.url?scp=85136323107&partnerID=8YFLogxK
http://www.scopus.com/inward/citedby.url?scp=85136323107&partnerID=8YFLogxK -
4Academic Journal
المؤلفون: Sleegers, Joeri, van den Berg, Daan
المصدر: Sleegers , J & van den Berg , D 2022 , ' The Hardest Hamiltonian Cycle Problem Instances : The Plateau of Yes and the Cliff of No ' , SN Computer Science , vol. 3 , no. 5 , 372 , pp. 1-16 . https://doi.org/10.1007/s42979-022-01256-0
مصطلحات موضوعية: Evolutionary algorithms, Hamiltonian cycle problem, Instance hardness, NP-complete, Plant propagation algorithm
الاتاحة: https://research.vu.nl/en/publications/b3c50e69-fb3d-48e7-90a7-a61976e479d1
https://doi.org/10.1007/s42979-022-01256-0
https://hdl.handle.net/1871.1/b3c50e69-fb3d-48e7-90a7-a61976e479d1
http://www.scopus.com/inward/record.url?scp=85134218461&partnerID=8YFLogxK
http://www.scopus.com/inward/citedby.url?scp=85134218461&partnerID=8YFLogxK -
5Academic Journal
المؤلفون: Sleegers, Joeri, Olij, Richard, van Horn, Gijs, van den Berg, Daan
مصطلحات موضوعية: ddc:330, ATSP, Branch and bound, Instance hardness, Replication, TSP
Relation: gbv-ppn:1749506033; Journal: Operations Research Perspectives; Volume: 7; Year: 2020; Pages: 1-6; Amsterdam: Elsevier; http://hdl.handle.net/10419/246430
-
6
-
7Periodical
المؤلفون: Sleegers, Joeri, van den Berg, Daan
المصدر: SN Computer Science; September 2022, Vol. 3 Issue: 5
-
8Academic Journal
-
9Periodical
المؤلفون: Sleegers, Joeri, Olij, Richard, van Horn, Gijs, van den Berg, Daan
المصدر: Operations Research Perspectives; January 2020, Vol. 7 Issue: 1