{"id":"https://openalex.org/W4382786979","doi":"https://doi.org/10.3390/a16070321","title":"A Surprisal-Based Greedy Heuristic for the Set Covering Problem","display_name":"A Surprisal-Based Greedy Heuristic for the Set Covering Problem","publication_year":2023,"publication_date":"2023-06-29","ids":{"openalex":"https://openalex.org/W4382786979","doi":"https://doi.org/10.3390/a16070321"},"language":"en","primary_location":{"id":"doi:10.3390/a16070321","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16070321","pdf_url":"https://www.mdpi.com/1999-4893/16/7/321/pdf?version=1688111513","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/16/7/321/pdf?version=1688111513","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045221076","display_name":"Tommaso Adamo","orcid":"https://orcid.org/0000-0002-9505-5869"},"institutions":[{"id":"https://openalex.org/I142910587","display_name":"University of Salento","ror":"https://ror.org/03fc1k060","country_code":"IT","type":"education","lineage":["https://openalex.org/I142910587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Tommaso Adamo","raw_affiliation_strings":["Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy","Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy;"],"affiliations":[{"raw_affiliation_string":"Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy","institution_ids":["https://openalex.org/I142910587"]},{"raw_affiliation_string":"Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy;","institution_ids":["https://openalex.org/I142910587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033820151","display_name":"Gianpaolo Ghiani","orcid":"https://orcid.org/0000-0002-5243-1799"},"institutions":[{"id":"https://openalex.org/I142910587","display_name":"University of Salento","ror":"https://ror.org/03fc1k060","country_code":"IT","type":"education","lineage":["https://openalex.org/I142910587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianpaolo Ghiani","raw_affiliation_strings":["Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy","Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy;"],"affiliations":[{"raw_affiliation_string":"Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy","institution_ids":["https://openalex.org/I142910587"]},{"raw_affiliation_string":"Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy;","institution_ids":["https://openalex.org/I142910587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049889261","display_name":"Emanuela Guerriero","orcid":"https://orcid.org/0000-0002-8959-5017"},"institutions":[{"id":"https://openalex.org/I142910587","display_name":"University of Salento","ror":"https://ror.org/03fc1k060","country_code":"IT","type":"education","lineage":["https://openalex.org/I142910587"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Emanuela Guerriero","raw_affiliation_strings":["Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy","Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy;"],"affiliations":[{"raw_affiliation_string":"Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy","institution_ids":["https://openalex.org/I142910587"]},{"raw_affiliation_string":"Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy;","institution_ids":["https://openalex.org/I142910587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5092089631","display_name":"Deborah Pareo","orcid":"https://orcid.org/0009-0000-8415-4258"},"institutions":[{"id":"https://openalex.org/I142910587","display_name":"University of Salento","ror":"https://ror.org/03fc1k060","country_code":"IT","type":"education","lineage":["https://openalex.org/I142910587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Deborah Pareo","raw_affiliation_strings":["Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy","Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy;"],"affiliations":[{"raw_affiliation_string":"Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy","institution_ids":["https://openalex.org/I142910587"]},{"raw_affiliation_string":"Department of Engineering for Innovation, University of Salento, Via per Monteroni, 73100 Lecce, Italy;","institution_ids":["https://openalex.org/I142910587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5049889261"],"corresponding_institution_ids":["https://openalex.org/I142910587"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.8073,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7580205,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"16","issue":"7","first_page":"321","last_page":"321"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"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/T11182","display_name":"Auction Theory and Applications","score":0.996999979019165,"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.8106401562690735},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.7570372223854065},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6732288002967834},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6021435856819153},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5483662486076355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5451790690422058},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5339791774749756},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5079489350318909},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4962926506996155},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4435933530330658},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43487468361854553},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3504335284233093},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3485158681869507},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1453215777873993}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.8106401562690735},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.7570372223854065},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6732288002967834},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6021435856819153},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5483662486076355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5451790690422058},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5339791774749756},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5079489350318909},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4962926506996155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4435933530330658},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43487468361854553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3504335284233093},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3485158681869507},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1453215777873993},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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":3,"locations":[{"id":"doi:10.3390/a16070321","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16070321","pdf_url":"https://www.mdpi.com/1999-4893/16/7/321/pdf?version=1688111513","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:ad34391c67e147f499068df73990f349","is_oa":true,"landing_page_url":"https://doaj.org/article/ad34391c67e147f499068df73990f349","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 16, Iss 7, p 321 (2023)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/16/7/321/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a16070321","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 16; Issue 7; Pages: 321","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a16070321","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16070321","pdf_url":"https://www.mdpi.com/1999-4893/16/7/321/pdf?version=1688111513","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320331528","display_name":"Ministero dell'Universit\u00e0 e della Ricerca","ror":null}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4382786979.pdf"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W187234903","https://openalex.org/W595863337","https://openalex.org/W1534075338","https://openalex.org/W1560337332","https://openalex.org/W1573881838","https://openalex.org/W1750082253","https://openalex.org/W1924535508","https://openalex.org/W1964312519","https://openalex.org/W1973727721","https://openalex.org/W1977723771","https://openalex.org/W2012355441","https://openalex.org/W2016929496","https://openalex.org/W2033405689","https://openalex.org/W2045425602","https://openalex.org/W2049967755","https://openalex.org/W2056908125","https://openalex.org/W2058140821","https://openalex.org/W2064209160","https://openalex.org/W2069729403","https://openalex.org/W2086958842","https://openalex.org/W2096090773","https://openalex.org/W2099813847","https://openalex.org/W2157054705","https://openalex.org/W2158446314","https://openalex.org/W2162812011","https://openalex.org/W2170003709","https://openalex.org/W2295299369","https://openalex.org/W2548112952","https://openalex.org/W2997776631","https://openalex.org/W3164210267","https://openalex.org/W3191263300","https://openalex.org/W4381683752","https://openalex.org/W6668011015","https://openalex.org/W6679486232"],"related_works":["https://openalex.org/W1533846201","https://openalex.org/W3095810947","https://openalex.org/W2081359543","https://openalex.org/W3012822644","https://openalex.org/W3146091432","https://openalex.org/W2950944401","https://openalex.org/W3121358922","https://openalex.org/W2767047809","https://openalex.org/W2034751042","https://openalex.org/W249555948"],"abstract_inverted_index":{"In":[0,21],"this":[1],"paper":[2],"we":[3,23],"exploit":[4],"concepts":[5],"from":[6,51],"Information":[7],"Theory":[8],"to":[9],"improve":[10],"the":[11,17,35,43,52,64,69],"classical":[12],"Chvatal":[13],"greedy":[14,27,91],"algorithm":[15,71,107],"for":[16,80,108],"set":[18],"covering":[19],"problem.":[20],"particular,":[22],"develop":[24],"a":[25,38,58],"new":[26,84],"procedure,":[28],"called":[29],"Surprisal-Based":[30],"Greedy":[31],"Heuristic":[32],"(SBH),":[33],"incorporating":[34],"computation":[36],"of":[37,63],"\u201csurprisal\u201d":[39],"measure":[40],"when":[41],"selecting":[42],"solution":[44],"columns.":[45],"Computational":[46],"experiments,":[47],"performed":[48],"on":[49,100],"instances":[50],"OR-Library,":[53],"showed":[54],"that":[55],"SBH":[56,112],"yields":[57],"2.5%":[59],"improvement":[60],"in":[61,96],"terms":[62],"objective":[65],"function":[66],"value":[67],"over":[68],"Chvatal\u2019s":[70],"while":[72],"retaining":[73],"similar":[74,94],"execution":[75],"times,":[76],"making":[77],"it":[78],"suitable":[79],"real-time":[81],"applications.":[82],"The":[83],"heuristic":[85],"was":[86],"also":[87],"compared":[88],"with":[89],"Kordalewski\u2019s":[90],"algorithm,":[92],"obtaining":[93],"solutions":[95],"much":[97],"shorter":[98],"times":[99],"large":[101],"instances,":[102,110],"and":[103,105],"Grossmann":[104],"Wool\u2019s":[106],"unicost":[109],"where":[111],"obtained":[113],"better":[114],"solutions.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-13T16:22:10.518609","created_date":"2023-07-02T00:00:00"}