{"id":"https://openalex.org/W4285591713","doi":"https://doi.org/10.1007/s42979-022-01256-0","title":"The Hardest Hamiltonian Cycle Problem Instances: The Plateau of Yes and the Cliff of No","display_name":"The Hardest Hamiltonian Cycle Problem Instances: The Plateau of Yes and the Cliff of No","publication_year":2022,"publication_date":"2022-07-15","ids":{"openalex":"https://openalex.org/W4285591713","doi":"https://doi.org/10.1007/s42979-022-01256-0"},"language":"en","primary_location":{"id":"doi:10.1007/s42979-022-01256-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-022-01256-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-022-01256-0.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s42979-022-01256-0.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036800029","display_name":"Joeri Sleegers","orcid":"https://orcid.org/0000-0003-1701-6319"},"institutions":[{"id":"https://openalex.org/I4210157292","display_name":"Yamasa Corporation (Japan)","ror":"https://ror.org/04t4e0r52","country_code":"JP","type":"company","lineage":["https://openalex.org/I4210157292"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["JP","NL"],"is_corresponding":true,"raw_author_name":"Joeri Sleegers","raw_affiliation_strings":["Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","Mice & Man Software and A.I. Development, Amsterdam, The Netherlands","Yamasan Science & Education, Amsterdam, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-1701-6319","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]},{"raw_affiliation_string":"Mice & Man Software and A.I. Development, Amsterdam, The Netherlands","institution_ids":[]},{"raw_affiliation_string":"Yamasan Science & Education, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I4210157292"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012462465","display_name":"Daan van den Berg","orcid":"https://orcid.org/0000-0001-5060-3342"},"institutions":[{"id":"https://openalex.org/I4210157292","display_name":"Yamasa Corporation (Japan)","ror":"https://ror.org/04t4e0r52","country_code":"JP","type":"company","lineage":["https://openalex.org/I4210157292"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["JP","NL"],"is_corresponding":false,"raw_author_name":"Daan van den Berg","raw_affiliation_strings":["Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","Mice & Man Software and A.I. Development, Amsterdam, The Netherlands","Yamasan Science & Education, Amsterdam, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-5060-3342","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]},{"raw_affiliation_string":"Mice & Man Software and A.I. Development, Amsterdam, The Netherlands","institution_ids":[]},{"raw_affiliation_string":"Yamasan Science & Education, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I4210157292"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036800029"],"corresponding_institution_ids":["https://openalex.org/I4210157292","https://openalex.org/I865915315"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.9711,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.79521865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"3","issue":"5","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6119034290313721},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.6084002256393433},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.5134790539741516},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4740676283836365},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46221867203712463},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4433932900428772},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4373731017112732},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.41679131984710693},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3661002814769745},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33194974064826965},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0949019193649292}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6119034290313721},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.6084002256393433},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.5134790539741516},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4740676283836365},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46221867203712463},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4433932900428772},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4373731017112732},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.41679131984710693},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3661002814769745},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33194974064826965},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0949019193649292},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s42979-022-01256-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-022-01256-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-022-01256-0.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:research.vu.nl:openaire/b3c50e69-fb3d-48e7-90a7-a61976e479d1","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/b3c50e69-fb3d-48e7-90a7-a61976e479d1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/b3c50e69-fb3d-48e7-90a7-a61976e479d1","is_oa":true,"landing_page_url":"https://hdl.handle.net/1871.1/b3c50e69-fb3d-48e7-90a7-a61976e479d1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"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","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s42979-022-01256-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-022-01256-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-022-01256-0.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6499999761581421,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4285591713.pdf","grobid_xml":"https://content.openalex.org/works/W4285591713.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1494115753","https://openalex.org/W1515153299","https://openalex.org/W1548578559","https://openalex.org/W1915652795","https://openalex.org/W1969186119","https://openalex.org/W2024060531","https://openalex.org/W2026273633","https://openalex.org/W2036265926","https://openalex.org/W2044400415","https://openalex.org/W2053191344","https://openalex.org/W2075335084","https://openalex.org/W2083883919","https://openalex.org/W2085719367","https://openalex.org/W2100012833","https://openalex.org/W2113189656","https://openalex.org/W2118382442","https://openalex.org/W2167036627","https://openalex.org/W2471120439","https://openalex.org/W2582697902","https://openalex.org/W2937978149","https://openalex.org/W2964281761","https://openalex.org/W2978459631","https://openalex.org/W3099508512","https://openalex.org/W3103375462","https://openalex.org/W3106250087","https://openalex.org/W3174227464","https://openalex.org/W3209722435","https://openalex.org/W4226322338","https://openalex.org/W6636690859"],"related_works":["https://openalex.org/W2760348722","https://openalex.org/W2783885583","https://openalex.org/W2120095724","https://openalex.org/W2368326437","https://openalex.org/W1631221657","https://openalex.org/W2357479099","https://openalex.org/W2364309619","https://openalex.org/W1525406239","https://openalex.org/W2371864976","https://openalex.org/W2391415040"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"use":[2],"two":[3],"evolutionary":[4,65,111],"algorithms":[5],"to":[6,132],"make":[7],"hard":[8,83,141],"instances":[9],"of":[10,23,46,101,122,135,138,154],"the":[11,21,28,35,68,76,99,103,110,116,127,149,157],"Hamiltonian":[12,158],"cycle":[13,159],"problem.":[14,36],"Hardness":[15],"(or":[16],"\u2018fitness\u2019),":[17],"is":[18,89],"defined":[19],"as":[20],"number":[22],"recursions":[24],"required":[25],"by":[26,63,109],"Vandegriend\u2013Culberson,":[27],"best":[29],"known":[30],"exact":[31],"backtracking":[32],"algorithm":[33],"for":[34],"The":[37],"hardest":[38,104,117,128],"instances,":[39],"all":[40],"non-Hamiltonian,":[41],"display":[42],"a":[43,123,136,152],"high":[44],"degree":[45],"regularity":[47],"and":[48,62,106],"scalability":[49],"across":[50],"graph":[51],"sizes.":[52],"These":[53],"graphs":[54,84],"are":[55,146],"found":[56],"multiple":[57],"times":[58],"through":[59],"independent":[60],"runs,":[61],"both":[64,102],"algorithms,":[66],"suggesting":[67],"search":[69],"space":[70],"might":[71],"contain":[72],"monotonic":[73],"paths":[74],"towards":[75],"global":[77],"maximum.":[78],"For":[79],"Hamiltonian-bound":[80],"evolution,":[81],"some":[82],"were":[85],"found,":[86],"but":[87],"convergence":[88],"much":[90],"less":[91],"consistent.":[92],"In":[93],"this":[94],"extended":[95],"paper,":[96],"we":[97],"survey":[98],"neighbourhoods":[100],"yes-":[105],"no-instances":[107],"produced":[108],"algorithms.":[112],"Results":[113],"show":[114],"that":[115],"no-instance":[118],"resides":[119],"on":[120],"top":[121],"steep":[124],"cliff,":[125],"while":[126],"yes-instance":[129],"turns":[130],"out":[131],"be":[133],"part":[134],"plateau":[137],"27":[139],"equally":[140],"instances.":[142],"While":[143],"definitive":[144],"answers":[145],"far":[147],"away,":[148],"results":[150],"provide":[151],"lot":[153],"insight":[155],"in":[156],"problem\u2019s":[160],"state":[161],"space.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}