{"title":"二叉覆盖问题的启发式方法","authors":"M. Servít, J. Zamazal","doi":"10.1109/EDAC.1992.205906","DOIUrl":null,"url":null,"abstract":"Covering problem is a problem of extraction of a minimum cost subset from a given set that satisfies certain constraints expressed as a Boolean formula in conjunctive normal form. This problem is NP-hard, heuristic methods are thus of interest. The authors present two heuristic methods to finding a nearly minimal solution and compare them to each other. The authors derive the asymptotic complexity of the presented methods and report some computational results obtained for a number of randomly generated covering problems.<<ETX>>","PeriodicalId":285019,"journal":{"name":"[1992] Proceedings The European Conference on Design Automation","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Heuristic approach to binate covering problem\",\"authors\":\"M. Servít, J. Zamazal\",\"doi\":\"10.1109/EDAC.1992.205906\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Covering problem is a problem of extraction of a minimum cost subset from a given set that satisfies certain constraints expressed as a Boolean formula in conjunctive normal form. This problem is NP-hard, heuristic methods are thus of interest. The authors present two heuristic methods to finding a nearly minimal solution and compare them to each other. The authors derive the asymptotic complexity of the presented methods and report some computational results obtained for a number of randomly generated covering problems.<<ETX>>\",\"PeriodicalId\":285019,\"journal\":{\"name\":\"[1992] Proceedings The European Conference on Design Automation\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings The European Conference on Design Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDAC.1992.205906\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings The European Conference on Design Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDAC.1992.205906","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Covering problem is a problem of extraction of a minimum cost subset from a given set that satisfies certain constraints expressed as a Boolean formula in conjunctive normal form. This problem is NP-hard, heuristic methods are thus of interest. The authors present two heuristic methods to finding a nearly minimal solution and compare them to each other. The authors derive the asymptotic complexity of the presented methods and report some computational results obtained for a number of randomly generated covering problems.<>
![[1992] Proceedings The European Conference on Design Automation](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
