{"title":"A cutting plane algorithm for the fixed charge problem","authors":"H. Taha","doi":"10.1145/800192.805672","DOIUrl":null,"url":null,"abstract":"An algorithm is devised for solving the fixed charge problem with linear constraints. The algorithm employs especially constructed cuts to locate the global optimum point. Computational results are included.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"3 1","pages":"12-15"},"PeriodicalIF":0.0000,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ASSETS. Annual ACM Conference on Assistive Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800192.805672","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
An algorithm is devised for solving the fixed charge problem with linear constraints. The algorithm employs especially constructed cuts to locate the global optimum point. Computational results are included.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
