{"id":"https://openalex.org/W6893953965","doi":"https://doi.org/10.5281/zenodo.6643236","title":"HyMeHeu-solver - A Hybrid Metaheuristic Solver for the Directed Feedback Vertex Set Problem","display_name":"HyMeHeu-solver - A Hybrid Metaheuristic Solver for the Directed Feedback Vertex Set Problem","publication_year":2022,"publication_date":"2022-06-14","ids":{"openalex":"https://openalex.org/W6893953965","doi":"https://doi.org/10.5281/zenodo.6643236"},"language":"en","primary_location":{"id":"pmh:oai:zenodo.org:6643236","is_oa":true,"landing_page_url":"https://zenodo.org/record/6643236","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"","raw_type":"software"},"type":"software","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/6643236","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Bresich, Maria","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Bresich, Maria","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Raidl, G\u00fcnther","orcid":"https://orcid.org/0000-0002-3293-177X"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Raidl, G\u00fcnther","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien"],"raw_orcid":"https://orcid.org/0000-0002-3293-177X","affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":null,"display_name":"Varga, Johannes","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Varga, Johannes","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7548999786376953},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5764999985694885},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5184999704360962},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5059999823570251},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.48559999465942383},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.4794999957084656},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.46619999408721924},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4645000100135803},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4471000134944916}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7548999786376953},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5764999985694885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5368000268936157},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5184999704360962},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5059999823570251},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.48559999465942383},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4794999957084656},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.46619999408721924},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4645000100135803},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4474000036716461},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4471000134944916},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.430400013923645},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4284000098705292},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4081000089645386},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.38089999556541443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35749998688697815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3560999929904938},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.34389999508857727},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3425000011920929},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.33169999718666077},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3156999945640564},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3140999972820282},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.31349998712539673},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.31049999594688416},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.304500013589859},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3003999888896942},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29809999465942383},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2655999958515167},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2522999942302704}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:zenodo.org:6643236","is_oa":true,"landing_page_url":"https://zenodo.org/record/6643236","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"","raw_type":"software"},{"id":"doi:10.5281/zenodo.6643236","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.6643236","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Software"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:6643236","is_oa":true,"landing_page_url":"https://zenodo.org/record/6643236","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"","raw_type":"software"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,16,46,97],"HyMeHeu-solver":[1],"is":[2,18,27,99,120,130],"a":[3,21,30,50,55,63,66,69,77,80,94,103,117,134],"<strong>Hy</strong>brid":[4],"<strong>Me</strong>ta":[5],"<strong>Heu</strong>ristic":[6],"solver":[7,48,107],"for":[8,149],"the":[9,39,73,85,109,140,146,150],"Directed":[10],"Feedback":[11],"Vertex":[12],"Set":[13],"problem":[14],"(DFVSP).":[15],"DFVSP":[17],"defined":[19],"on":[20,54,116],"directed":[22],"graph":[23,40],"and":[24,68,83,139],"its":[25],"aim":[26],"to":[28,92,122],"find":[29],"minimum":[31],"cardinality":[32],"subset":[33],"of":[34,65,79],"vertices":[35],"whose":[36],"removal":[37],"from":[38],"results":[41],"in":[42,108],"an":[43,124],"acyclic":[44],"graph.":[45],"provided":[47],"employs":[49],"hybrid":[51],"metaheuristic":[52],"based":[53,115],"large":[56],"neighborhood":[57],"search":[58,137],"(LNS),":[59],"which":[60],"repeatedly":[61],"applies":[62],"pair":[64],"destroy":[67,86],"repair":[70,74,110],"operator.":[71,111],"First,":[72],"operator":[75,87],"changes":[76],"part":[78],"given":[81],"solution":[82,91,129,142],"then,":[84],"fixes":[88],"this":[89],"partial":[90],"recover":[93],"valid":[95],"solution.":[96,126],"hybridization":[98],"achieved":[100],"by":[101,132],"using":[102],"mixed":[104],"integer":[105],"programming":[106],"A":[112],"construction":[113],"heuristic":[114],"greedy":[118],"function":[119],"used":[121],"generate":[123],"initial":[125,128],"This":[127],"improved":[131],"applying":[133],"simple":[135],"local":[136],"procedure":[138],"resulting":[141],"then":[143],"serves":[144],"as":[145],"starting":[147],"point":[148],"LNS":[151],"procedure.":[152]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}