加权MAX-SAT问题的近似解

Satisfiability Problem: Theory and Applications Pub Date : 1900-01-01 DOI:10.1090/dimacs/035/11

M. G. Resende, L. Pitsoulis, P. Pardalos

{"title":"加权MAX-SAT问题的近似解","authors":"M. G. Resende, L. Pitsoulis, P. Pardalos","doi":"10.1090/dimacs/035/11","DOIUrl":null,"url":null,"abstract":"Computing the optimal solution to an instance of the weighted maximum satissability problem (MAX-SAT) is diicult even when each clause contains at most two literals. In this paper, we describe a greedy randomized adaptive search procedure (GRASP) for computing approximate solutions of weighted MAX-SAT problems. The heuristic is tested on a large set of test instances. Computational experience indicates the suitability of GRASP for this class of problems.","PeriodicalId":434373,"journal":{"name":"Satisfiability Problem: Theory and Applications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"91","resultStr":"{\"title\":\"Approximate solution of weighted MAX-SAT problems using GRASP\",\"authors\":\"M. G. Resende, L. Pitsoulis, P. Pardalos\",\"doi\":\"10.1090/dimacs/035/11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Computing the optimal solution to an instance of the weighted maximum satissability problem (MAX-SAT) is diicult even when each clause contains at most two literals. In this paper, we describe a greedy randomized adaptive search procedure (GRASP) for computing approximate solutions of weighted MAX-SAT problems. The heuristic is tested on a large set of test instances. Computational experience indicates the suitability of GRASP for this class of problems.\",\"PeriodicalId\":434373,\"journal\":{\"name\":\"Satisfiability Problem: Theory and Applications\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"91\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Satisfiability Problem: Theory and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/dimacs/035/11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Satisfiability Problem: Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/dimacs/035/11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 91

摘要

即使每个子句最多包含两个字面量，计算加权最大可满足性问题(MAX-SAT)实例的最优解也是困难的。本文描述了一种贪心随机自适应搜索算法(GRASP)，用于计算加权MAX-SAT问题的近似解。在大量的测试实例集上对启发式算法进行了测试。计算经验表明，GRASP适合这类问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Approximate solution of weighted MAX-SAT problems using GRASP

Computing the optimal solution to an instance of the weighted maximum satissability problem (MAX-SAT) is diicult even when each clause contains at most two literals. In this paper, we describe a greedy randomized adaptive search procedure (GRASP) for computing approximate solutions of weighted MAX-SAT problems. The heuristic is tested on a large set of test instances. Computational experience indicates the suitability of GRASP for this class of problems.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Satisfiability Problem: Theory and Applications

自引率

0.00%

发文量