{"id":"https://openalex.org/W4317696693","doi":"https://doi.org/10.1080/01605682.2022.2147458","title":"ILSGVCP: An improved local search algorithm for generalized vertex cover problem","display_name":"ILSGVCP: An improved local search algorithm for generalized vertex cover problem","publication_year":2023,"publication_date":"2023-01-21","ids":{"openalex":"https://openalex.org/W4317696693","doi":"https://doi.org/10.1080/01605682.2022.2147458"},"language":"en","primary_location":{"id":"doi:10.1080/01605682.2022.2147458","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01605682.2022.2147458","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080571464","display_name":"Ran Tai","orcid":"https://orcid.org/0000-0003-4547-1730"},"institutions":[{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ran Tai","raw_affiliation_strings":["Jilin University, Changchun, Jilin, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jilin University, Changchun, Jilin, China","institution_ids":["https://openalex.org/I194450716"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049462948","display_name":"Dantong Ouyang","orcid":"https://orcid.org/0000-0003-4504-1423"},"institutions":[{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dantong Ouyang","raw_affiliation_strings":["Jilin University, Changchun, Jilin, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jilin University, Changchun, Jilin, China","institution_ids":["https://openalex.org/I194450716"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100760521","display_name":"Ruizhi Li","orcid":"https://orcid.org/0000-0003-2915-8242"},"institutions":[{"id":"https://openalex.org/I179324530","display_name":"Jilin University of Finance and Economics","ror":"https://ror.org/04az9eh24","country_code":"CN","type":"education","lineage":["https://openalex.org/I179324530"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ruizhi Li","raw_affiliation_strings":["Jilin University of Finance and Economics, Changchun, Jilin, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jilin University of Finance and Economics, Changchun, Jilin, China","institution_ids":["https://openalex.org/I179324530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068082037","display_name":"Liming Zhang","orcid":"https://orcid.org/0000-0001-8263-4194"},"institutions":[{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Liming Zhang","raw_affiliation_strings":["Jilin University, Changchun, Jilin, China"],"raw_orcid":"https://orcid.org/0000-0001-8263-4194","affiliations":[{"raw_affiliation_string":"Jilin University, Changchun, Jilin, China","institution_ids":["https://openalex.org/I194450716"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5068082037"],"corresponding_institution_ids":["https://openalex.org/I194450716"],"apc_list":null,"apc_paid":null,"fwci":1.1852,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81037385,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"74","issue":"11","first_page":"2382","last_page":"2390"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9904000163078308,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8583502769470215},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6374972462654114},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.6046577095985413},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5785302519798279},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5626928210258484},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5333535671234131},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.467489629983902},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.46666115522384644},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4198697805404663},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.4111194312572479},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3895837366580963},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36486929655075073},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.3456622362136841},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.31198298931121826},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2323933243751526},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14719167351722717}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8583502769470215},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6374972462654114},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.6046577095985413},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5785302519798279},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5626928210258484},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5333535671234131},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.467489629983902},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.46666115522384644},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4198697805404663},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.4111194312572479},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3895837366580963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36486929655075073},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.3456622362136841},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.31198298931121826},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2323933243751526},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14719167351722717},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/01605682.2022.2147458","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01605682.2022.2147458","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:taf:tjorxx:v:74:y:2023:i:11:p:2382-2390","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/01605682.2022.2147458","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1505245505","https://openalex.org/W1509289098","https://openalex.org/W1581948821","https://openalex.org/W1873423029","https://openalex.org/W1980048226","https://openalex.org/W1980843902","https://openalex.org/W2002809037","https://openalex.org/W2018165085","https://openalex.org/W2038777942","https://openalex.org/W2052942252","https://openalex.org/W2056633239","https://openalex.org/W2067435011","https://openalex.org/W2108109721","https://openalex.org/W2110504071","https://openalex.org/W2122448854","https://openalex.org/W2123718581","https://openalex.org/W2164144893","https://openalex.org/W2189172100","https://openalex.org/W2240008187","https://openalex.org/W2251648435","https://openalex.org/W2252595579","https://openalex.org/W2343848941","https://openalex.org/W2344508322","https://openalex.org/W2401610261","https://openalex.org/W2437431645","https://openalex.org/W2525786140","https://openalex.org/W2550971438","https://openalex.org/W2739688939","https://openalex.org/W2949180570","https://openalex.org/W2998575712","https://openalex.org/W2998631884","https://openalex.org/W3099305697","https://openalex.org/W3160441411","https://openalex.org/W3212797097","https://openalex.org/W4200148736","https://openalex.org/W4283795370"],"related_works":["https://openalex.org/W2036594069","https://openalex.org/W1537780499","https://openalex.org/W2794473043","https://openalex.org/W1521720388","https://openalex.org/W135686785","https://openalex.org/W4229024675","https://openalex.org/W2087594839","https://openalex.org/W1516893820","https://openalex.org/W2900392151","https://openalex.org/W2574129481"],"abstract_inverted_index":{"The":[0],"generalized":[1],"vertex":[2,15],"cover":[3,16],"problem":[4,10,17],"(GVCP)":[5],"is":[6,25,57],"a":[7,63,70,77],"well-known":[8],"combinatorial":[9],"of":[11],"the":[12,45,131],"classic":[13],"minimum":[14],"with":[18,76,108],"rich":[19],"applications.":[20],"And":[21],"local":[22,41,82],"search":[23,42,83],"algorithm":[24,29,43,95],"an":[26,39],"effective":[27],"heuristic":[28],"to":[30,61,92,102,110],"solve":[31],"GVCP.":[32,132],"Therefore,":[33],"In":[34],"this":[35],"paper,":[36],"we":[37,68,87,98],"develop":[38],"improved":[40],"for":[44,59,130],"problem,":[46],"namely":[47],"ILSGVCP.":[48,96],"Specifically,":[49],"new":[50],"choosing":[51],"small":[52],"weight":[53],"rules":[54],"called":[55,74],"CSWR":[56,89],"presented":[58],"initialization":[60],"acquire":[62],"high-quality":[64],"candidate":[65],"solution.":[66],"Furthermore,":[67],"propose":[69,93],"dynamic":[71],"perturbation":[72],"mechanism":[73],"DP":[75,91],"novel":[78],"formula":[79],"which":[80],"makes":[81],"perturbed":[84],"dynamically.":[85],"Moreover,":[86],"combine":[88],"and":[90,113,116],"our":[94],"Finally,":[97],"carry":[99],"out":[100],"experiments":[101],"evaluate":[103],"ILSGVCP":[104,125],"on":[105],"random":[106],"instances":[107],"up":[109],"1000":[111],"vertices":[112],"400,000":[114],"edges":[115],"DIMACS":[117],"instances.":[118],"A":[119],"detailed":[120],"experimental":[121],"evaluation":[122],"reveals":[123],"that":[124],"outperforms":[126],"other":[127],"state-of-the-art":[128],"algorithms":[129]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}