{"id":"https://openalex.org/W1987869562","doi":"https://doi.org/10.1145/1187436.1216581","title":"GRASP with path relinking for the weighted MAXSAT problem","display_name":"GRASP with path relinking for the weighted MAXSAT problem","publication_year":2007,"publication_date":"2007-02-09","ids":{"openalex":"https://openalex.org/W1987869562","doi":"https://doi.org/10.1145/1187436.1216581","mag":"1987869562"},"language":"en","primary_location":{"id":"doi:10.1145/1187436.1216581","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1187436.1216581","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/A5090584718","display_name":"Paola Festa","orcid":"https://orcid.org/0000-0002-2243-6054"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Paola Festa","raw_affiliation_strings":["University of Napoli Federico II, Napoli, Italy"],"affiliations":[{"raw_affiliation_string":"University of Napoli Federico II, Napoli, Italy","institution_ids":["https://openalex.org/I71267560"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050062467","display_name":"P\u00e3nos M. Pardalos","orcid":"https://orcid.org/0000-0001-9623-8053"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Panos M. Pardalos","raw_affiliation_strings":["University of Florida, Gainesville, FL"],"affiliations":[{"raw_affiliation_string":"University of Florida, Gainesville, FL","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029687251","display_name":"Leonidas Pitsoulis","orcid":null},"institutions":[{"id":"https://openalex.org/I21370196","display_name":"Aristotle University of Thessaloniki","ror":"https://ror.org/02j61yw88","country_code":"GR","type":"education","lineage":["https://openalex.org/I21370196"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Leonidas S. Pitsoulis","raw_affiliation_strings":["Aristotle University of Thessaloniki, Thessaloniki, Greece","Aristotle University of Thessaloniki Thessaloniki, Greece"],"affiliations":[{"raw_affiliation_string":"Aristotle University of Thessaloniki, Thessaloniki, Greece","institution_ids":["https://openalex.org/I21370196"]},{"raw_affiliation_string":"Aristotle University of Thessaloniki Thessaloniki, Greece","institution_ids":["https://openalex.org/I21370196"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029261812","display_name":"Maur\u00edcio G. C. Resende","orcid":"https://orcid.org/0000-0001-7462-6207"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mauricio G. C. Resende","raw_affiliation_strings":["AT&T Labs Research, Florham Park, NJ"],"affiliations":[{"raw_affiliation_string":"AT&T Labs Research, Florham Park, NJ","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5090584718"],"corresponding_institution_ids":["https://openalex.org/I71267560"],"apc_list":null,"apc_paid":null,"fwci":3.7357,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.9273194,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"11","issue":null,"first_page":null,"last_page":null},"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.9995999932289124,"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.9995999932289124,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9983999729156494,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983000159263611,"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/grasp","display_name":"GRASP","score":0.9322917461395264},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7304838299751282},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6521406173706055},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6268376111984253},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5830422639846802},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5304113030433655},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.43432679772377014},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.4105319380760193},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3963410258293152},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3259637951850891},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.29399144649505615}],"concepts":[{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.9322917461395264},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7304838299751282},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6521406173706055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6268376111984253},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5830422639846802},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5304113030433655},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.43432679772377014},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.4105319380760193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3963410258293152},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3259637951850891},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.29399144649505615},{"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.1145/1187436.1216581","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1187436.1216581","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.72.4417","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.4417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/~mgcr/doc/gmaxsatpr-jea.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W48084009","https://openalex.org/W139325465","https://openalex.org/W179940750","https://openalex.org/W264488922","https://openalex.org/W272982077","https://openalex.org/W595785050","https://openalex.org/W1513769081","https://openalex.org/W1516430219","https://openalex.org/W1566129741","https://openalex.org/W1667614912","https://openalex.org/W1968661326","https://openalex.org/W1977287297","https://openalex.org/W1985123706","https://openalex.org/W1991107961","https://openalex.org/W1999032440","https://openalex.org/W2001564241","https://openalex.org/W2004660767","https://openalex.org/W2011039300","https://openalex.org/W2024110228","https://openalex.org/W2036265926","https://openalex.org/W2038806264","https://openalex.org/W2040924621","https://openalex.org/W2072181151","https://openalex.org/W2079641336","https://openalex.org/W2081782720","https://openalex.org/W2098939501","https://openalex.org/W2099861483","https://openalex.org/W2103981148","https://openalex.org/W2109039359","https://openalex.org/W2109293843","https://openalex.org/W2110376540","https://openalex.org/W2116197568","https://openalex.org/W2117942072","https://openalex.org/W2126331452","https://openalex.org/W2137373403","https://openalex.org/W2398137523","https://openalex.org/W2500747461","https://openalex.org/W2607539118","https://openalex.org/W2997776631","https://openalex.org/W4238262801","https://openalex.org/W4241001970","https://openalex.org/W4245266864","https://openalex.org/W6650788953","https://openalex.org/W6659573362"],"related_works":["https://openalex.org/W2541071804","https://openalex.org/W3135694647","https://openalex.org/W2094485034","https://openalex.org/W20026230","https://openalex.org/W4251926495","https://openalex.org/W2393373993","https://openalex.org/W2896014154","https://openalex.org/W2055379348","https://openalex.org/W4294811694","https://openalex.org/W982603479"],"abstract_inverted_index":{"A":[0],"GRASP":[1,78,85,91],"with":[2,92],"path":[3,87,93,99],"relinking":[4,59,94,100],"for":[5,53,112],"finding":[6],"good-quality":[7,69,110],"solutions":[8,39,71],"of":[9,44,82,98],"the":[10,45,66,77,83,90,96,103,113],"weighted":[11,55,114],"maximum":[12,115],"satisfiability":[13,116],"problem":[14],"(MAX-SAT)":[15],"is":[16,28,60],"described":[17],"in":[18,101],"this":[19],"paper.":[20],"GRASP,":[21],"or":[22],"Greedy":[23],"Randomized":[24],"Adaptive":[25],"Search":[26],"Procedure,":[27],"a":[29,61,109],"randomized":[30],"multistart":[31],"metaheuristic,":[32],"where,":[33],"at":[34],"each":[35,42],"iteration,":[36],"locally":[37],"optimal":[38],"are":[40],"constructed,":[41],"independent":[43],"others.":[46],"Previous":[47],"experimental":[48],"results":[49],"indicate":[50],"its":[51],"effectiveness":[52,97],"solving":[54],"MAX-SAT":[56],"instances.":[57],"Path":[58],"procedure":[62],"used":[63],"to":[64,107],"intensify":[65],"search":[67],"around":[68],"isolated":[70],"that":[72],"have":[73],"been":[74],"produced":[75],"by":[76],"heuristic.":[79],"Experimental":[80],"comparison":[81],"pure":[84],"(without":[86],"relinking)":[88],"and":[89],"illustrates":[95],"decreasing":[102],"average":[104],"time":[105],"needed":[106],"find":[108],"solution":[111],"problem.":[117]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}