{"id":"https://openalex.org/W1516430219","doi":"https://doi.org/10.1090/dimacs/035/11","title":"Approximate solution of weighted MAX-SAT problems using GRASP","display_name":"Approximate solution of weighted MAX-SAT problems using GRASP","publication_year":1997,"publication_date":"1997-12-09","ids":{"openalex":"https://openalex.org/W1516430219","doi":"https://doi.org/10.1090/dimacs/035/11","mag":"1516430219"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/035/11","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/035/11","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5029261812","display_name":"Maur\u00edcio G. C. Resende","orcid":"https://orcid.org/0000-0001-7462-6207"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mauricio Resende","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029687251","display_name":"Leonidas Pitsoulis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leonidas Pitsoulis","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","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 Pardalos","raw_affiliation_strings":["University of Florida, Gainesville, FL"],"affiliations":[{"raw_affiliation_string":"University of Florida, Gainesville, FL","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5029261812"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":21.9512,"has_fulltext":false,"cited_by_count":81,"citation_normalized_percentile":{"value":0.99356349,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"393","last_page":"405"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.8903999924659729,"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/T12176","display_name":"Optimization and Packing Problems","score":0.8903999924659729,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.8628000020980835,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.7876999974250793,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/grasp","display_name":"GRASP","score":0.8639537692070007},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5061613917350769},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3660590946674347},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06778115034103394}],"concepts":[{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.8639537692070007},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5061613917350769},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3660590946674347},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06778115034103394}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1090/dimacs/035/11","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/035/11","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.5461","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.5461","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/gmaxsat.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.52.803","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.803","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.codiciel.fr/netlib/att/math/people/mgcr/doc/gmaxsat.ps.Z","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2163296013","https://openalex.org/W165915117","https://openalex.org/W2326995835","https://openalex.org/W2743859443","https://openalex.org/W2059402478","https://openalex.org/W2123347777","https://openalex.org/W4387804363","https://openalex.org/W2477150073","https://openalex.org/W2019547100"],"abstract_inverted_index":{"Computing":[0],"the":[1,8,59],"optimal":[2],"solution":[3],"to":[4],"an":[5],"instance":[6],"of":[7,41,53,61,66],"weighted":[9,42],"maximum":[10],"satisfiability":[11],"problem":[12],"(MAX-SAT)":[13],"is":[14,47],"difficult":[15],"even":[16],"when":[17],"each":[18],"clause":[19],"contains":[20],"at":[21],"most":[22],"two":[23],"literals.":[24],"In":[25],"this":[26,64],"paper,":[27],"we":[28],"describe":[29],"a":[30,50],"greedy":[31],"randomized":[32],"adaptive":[33],"search":[34],"procedure":[35],"(GRASP)":[36],"for":[37,63],"computing":[38],"approximate":[39],"solutions":[40],"MAX-SAT":[43],"problems.":[44,67],"The":[45],"heuristic":[46],"tested":[48],"on":[49],"large":[51],"set":[52],"test":[54],"instances.":[55],"Computational":[56],"experience":[57],"indicates":[58],"suitability":[60],"GRASP":[62],"class":[65]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}