{"title":"A gradient search algorithm for set covering problems","authors":"N. Ula, A. Nouh","doi":"10.1109/CDC.1980.272017","DOIUrl":null,"url":null,"abstract":"A numerical algorithm is presented to solve set covering problems using gradient search technique. The method involves a valley seeking point scanning over the polyhedra formed by the constraint hyper surfaces. The concept is illustrated through experimental results.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1980-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1980.272017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A numerical algorithm is presented to solve set covering problems using gradient search technique. The method involves a valley seeking point scanning over the polyhedra formed by the constraint hyper surfaces. The concept is illustrated through experimental results.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
