{"id":"https://openalex.org/W2587435853","doi":"https://doi.org/10.1504/ijmor.2018.10013170","title":"A two-phase heuristic for set covering","display_name":"A two-phase heuristic for set covering","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2587435853","doi":"https://doi.org/10.1504/ijmor.2018.10013170","mag":"2587435853"},"language":"en","primary_location":{"id":"doi:10.1504/ijmor.2018.10013170","is_oa":true,"landing_page_url":"https://doi.org/10.1504/ijmor.2018.10013170","pdf_url":"https://www.inderscienceonline.com/doi/full/10.1504/IJMOR.2018.092962","source":{"id":"https://openalex.org/S135796719","display_name":"International Journal of Mathematics in Operational Research","issn_l":"1757-5850","issn":["1757-5850","1757-5869"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Mathematics in Operational Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.inderscienceonline.com/doi/full/10.1504/IJMOR.2018.092962","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048515725","display_name":"Meryem Cheraitia","orcid":"https://orcid.org/0000-0003-3642-5572"},"institutions":[{"id":"https://openalex.org/I4210097536","display_name":"University of Guelma","ror":"https://ror.org/00xe6p546","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210097536"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Meryem Cheraitia","raw_affiliation_strings":["LabSTIC, 8 Mai 1945 University, P.O. Box 401, 24000 Guelma, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LabSTIC, 8 Mai 1945 University, P.O. Box 401, 24000 Guelma, Algeria","institution_ids":["https://openalex.org/I4210097536"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044495613","display_name":"Abdellah Salhi","orcid":"https://orcid.org/0000-0003-2433-2627"},"institutions":[{"id":"https://openalex.org/I4210097536","display_name":"University of Guelma","ror":"https://ror.org/00xe6p546","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210097536"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Abdellah Salhi","raw_affiliation_strings":["LabSTIC, 8 Mai 1945 University, P.O. Box 401, 24000 Guelma, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LabSTIC, 8 Mai 1945 University, P.O. Box 401, 24000 Guelma, Algeria","institution_ids":["https://openalex.org/I4210097536"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041767573","display_name":"Salim Haddadi","orcid":"https://orcid.org/0000-0001-8347-169X"},"institutions":[{"id":"https://openalex.org/I110002522","display_name":"University of Essex","ror":"https://ror.org/02nkf1q06","country_code":"GB","type":"education","lineage":["https://openalex.org/I110002522"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Salim Haddadi","raw_affiliation_strings":["Department of Mathematical Sciences, University of Essex, Wivenhoe Park, Colchester CO4 3SQ, UK#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, University of Essex, Wivenhoe Park, Colchester CO4 3SQ, UK#TAB#","institution_ids":["https://openalex.org/I110002522"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4866,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70058589,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"1","first_page":"61","last_page":"61"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.993399977684021,"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.993399977684021,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9886999726295471,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9811000227928162,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6177058815956116},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5402871966362},{"id":"https://openalex.org/keywords/phase","display_name":"Phase (matter)","score":0.4483923017978668},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36136192083358765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3436114192008972},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26739567518234253},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09267094731330872}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6177058815956116},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5402871966362},{"id":"https://openalex.org/C44280652","wikidata":"https://www.wikidata.org/wiki/Q104837","display_name":"Phase (matter)","level":2,"score":0.4483923017978668},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36136192083358765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3436114192008972},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26739567518234253},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09267094731330872},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijmor.2018.10013170","is_oa":true,"landing_page_url":"https://doi.org/10.1504/ijmor.2018.10013170","pdf_url":"https://www.inderscienceonline.com/doi/full/10.1504/IJMOR.2018.092962","source":{"id":"https://openalex.org/S135796719","display_name":"International Journal of Mathematics in Operational Research","issn_l":"1757-5850","issn":["1757-5850","1757-5869"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Mathematics in Operational Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1504/ijmor.2018.10013170","is_oa":true,"landing_page_url":"https://doi.org/10.1504/ijmor.2018.10013170","pdf_url":"https://www.inderscienceonline.com/doi/full/10.1504/IJMOR.2018.092962","source":{"id":"https://openalex.org/S135796719","display_name":"International Journal of Mathematics in Operational Research","issn_l":"1757-5850","issn":["1757-5850","1757-5869"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Mathematics in Operational Research","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2587435853.pdf","grobid_xml":"https://content.openalex.org/works/W2587435853.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W84440676","https://openalex.org/W988858537","https://openalex.org/W1750082253","https://openalex.org/W1973727721","https://openalex.org/W2013283176","https://openalex.org/W2022719899","https://openalex.org/W2034107192","https://openalex.org/W2039862033","https://openalex.org/W2056908125","https://openalex.org/W2057565694","https://openalex.org/W2060761685","https://openalex.org/W2070083506","https://openalex.org/W2076570464","https://openalex.org/W2079725257","https://openalex.org/W2091836882","https://openalex.org/W2099813847","https://openalex.org/W2133613508","https://openalex.org/W2156557985","https://openalex.org/W2157054705","https://openalex.org/W2162812011","https://openalex.org/W2529629665","https://openalex.org/W3147243493","https://openalex.org/W4252353527","https://openalex.org/W6626012044","https://openalex.org/W6674839842"],"related_works":["https://openalex.org/W2334323075","https://openalex.org/W2328056206","https://openalex.org/W2355215981","https://openalex.org/W2735382589","https://openalex.org/W4295308966","https://openalex.org/W4320016096","https://openalex.org/W2023444198","https://openalex.org/W1828750805","https://openalex.org/W3006241023","https://openalex.org/W152379590"],"abstract_inverted_index":{"The":[0,20,59,69,92],"set":[1],"covering":[2],"problem":[3,100,119],"(SCP)":[4],"is":[5],"a":[6,14,39],"well-known":[7],"computationally":[8],"intractable":[9],"problem.":[10,47],"We":[11],"suggest":[12],"here":[13],"two-phase":[15],"heuristic":[16,42,61,71],"to":[17,44,112],"solve":[18],"it.":[19],"first":[21],"phase":[22,37],"reduces":[23],"substantially":[24],"the":[25,28,35,45,55,96,99,115,118,122],"size":[26,101],"of":[27,98,114,117],"given":[29],"SCP":[30],"by":[31,65,85,102],"removing":[32],"some":[33],"variables;":[34],"second":[36],"applies":[38],"simple":[40],"Lagrangian":[41,56],"applied":[43],"reduced":[46],"Construction":[48],"and":[49,127],"improvement":[50,70],"heuristics":[51],"are":[52,82,130],"embedded":[53],"in":[54,95,108],"solution":[57,123],"approach.":[58],"construction":[60],"provides":[62],"good":[63],"covers":[64,74,81],"solving":[66,86],"small":[67,90],"SCPs.":[68,91],"inserts":[72],"these":[73],"into":[75],"larger":[76],"ones":[77],"from":[78],"which":[79],"better":[80],"extracted,":[83],"again":[84],"different":[87],"but":[88],"also":[89],"novelty":[93],"lies":[94],"reduction":[97],"an":[103],"effective":[104],"variable-fixing":[105],"heuristic,":[106],"which,":[107],"practice,":[109],"eliminates":[110],"up":[111],"95%":[113],"variables":[116],"without":[120],"sacrificing":[121],"quality.":[124],"Extensive":[125],"computational":[126],"comparative":[128],"results":[129],"presented.":[131]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}