{"title":"近似有界0-1整数线性规划","authors":"D. Peleg, G. Schechtman, A. Wool","doi":"10.1109/ISTCS.1993.253482","DOIUrl":null,"url":null,"abstract":"The problem of finding approximate solutions for a subclass of 0-1 integer linear programming denoted by I L P(k,p) is considered. The problem involves finding X in","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"95 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":"{\"title\":\"Approximating bounded 0-1 integer linear programs\",\"authors\":\"D. Peleg, G. Schechtman, A. Wool\",\"doi\":\"10.1109/ISTCS.1993.253482\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of finding approximate solutions for a subclass of 0-1 integer linear programming denoted by I L P(k,p) is considered. The problem involves finding X in\",\"PeriodicalId\":281109,\"journal\":{\"name\":\"[1993] The 2nd Israel Symposium on Theory and Computing Systems\",\"volume\":\"95 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] The 2nd Israel Symposium on Theory and Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISTCS.1993.253482\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTCS.1993.253482","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29
摘要
研究了0-1整数线性规划的一个子类的近似解问题，该子类记为I L P(k, P)。这个问题涉及到求X in
The problem of finding approximate solutions for a subclass of 0-1 integer linear programming denoted by I L P(k,p) is considered. The problem involves finding X in
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1993] The 2nd Israel Symposium on Theory and Computing Systems](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
