发布求助
文献互助 智能选刊 最新文献

Conference on Integer Programming and Combinatorial Optimization最新文献

筛选
英文 中文
Intersection Cuts for Bilevel Optimization 双层优化的相交切割
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-06-01 DOI: 10.1007/978-3-319-33461-5_7
M. Fischetti, I. Ljubić, M. Monaci, Markus Sinnl
{"title":"Intersection Cuts for Bilevel Optimization","authors":"M. Fischetti, I. Ljubić, M. Monaci, Markus Sinnl","doi":"10.1007/978-3-319-33461-5_7","DOIUrl":"https://doi.org/10.1007/978-3-319-33461-5_7","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133213039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 41
On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming 凹混合整数二次规划的逼近算法
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-06-01 DOI: 10.1007/978-3-319-33461-5_1
Alberto Del Pia
{"title":"On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming","authors":"Alberto Del Pia","doi":"10.1007/978-3-319-33461-5_1","DOIUrl":"https://doi.org/10.1007/978-3-319-33461-5_1","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123732079","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Rescaled Coordinate Descent Methods for Linear Programming 线性规划的重标坐标下降方法
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-06-01 DOI: 10.1007/978-3-319-33461-5_3
D. Dadush, László A. Végh, G. Zambelli
{"title":"Rescaled Coordinate Descent Methods for Linear Programming","authors":"D. Dadush, László A. Végh, G. Zambelli","doi":"10.1007/978-3-319-33461-5_3","DOIUrl":"https://doi.org/10.1007/978-3-319-33461-5_3","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130356935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point 确定Gomory-Chvátal闭包的空性是np完全的，即使对于不含整数点的有理多面体也是如此
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-06-01 DOI: 10.1007/978-3-319-33461-5_32
G. Cornuéjols, Yanjun Li
{"title":"Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point","authors":"G. Cornuéjols, Yanjun Li","doi":"10.1007/978-3-319-33461-5_32","DOIUrl":"https://doi.org/10.1007/978-3-319-33461-5_32","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130378412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem 最大旅行商问题的4/5逼近算法
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2015-12-31 DOI: 10.1007/978-3-319-59250-3_15
S. Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki
{"title":"A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem","authors":"S. Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki","doi":"10.1007/978-3-319-59250-3_15","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_15","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127914506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Approximation-Friendly Discrepancy Rounding 近似友好的差异舍入
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2015-12-07 DOI: 10.1007/978-3-319-33461-5_31
N. Bansal, V. Nagarajan
{"title":"Approximation-Friendly Discrepancy Rounding","authors":"N. Bansal, V. Nagarajan","doi":"10.1007/978-3-319-33461-5_31","DOIUrl":"https://doi.org/10.1007/978-3-319-33461-5_31","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129368965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+epsilon Capacity Violation 具有1+epsilon容量破坏的一致容化k-中值问题的近似算法
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2015-11-23 DOI: 10.1007/978-3-319-33461-5_22
J. Byrka, Bartosz Rybicki, Sumedha Uniyal
{"title":"An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+epsilon Capacity Violation","authors":"J. Byrka, Bartosz Rybicki, Sumedha Uniyal","doi":"10.1007/978-3-319-33461-5_22","DOIUrl":"https://doi.org/10.1007/978-3-319-33461-5_22","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114564993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
Extended Formulations in Mixed-Integer Convex Programming 混合整数凸规划中的扩展公式
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2015-11-20 DOI: 10.1007/978-3-319-33461-5_9
Miles Lubin, Emre Yamangil, R. Bent, J. Vielma
{"title":"Extended Formulations in Mixed-Integer Convex Programming","authors":"Miles Lubin, Emre Yamangil, R. Bent, J. Vielma","doi":"10.1007/978-3-319-33461-5_9","DOIUrl":"https://doi.org/10.1007/978-3-319-33461-5_9","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122127363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 55
Short Tours through Large Linear Forests 穿越大型线性森林的短途旅行
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2014-06-22 DOI: 10.1007/978-3-319-07557-0_23
U. Feige, R. Ravi, Mohit Singh
{"title":"Short Tours through Large Linear Forests","authors":"U. Feige, R. Ravi, Mohit Singh","doi":"10.1007/978-3-319-07557-0_23","DOIUrl":"https://doi.org/10.1007/978-3-319-07557-0_23","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132890390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
The Triangle Splitting Method for Biobjective Mixed Integer Programming 双目标混合整数规划的三角分割法
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2014-06-22 DOI: 10.1007/978-3-319-07557-0_14
N. Boland, H. Charkhgard, M. Savelsbergh
{"title":"The Triangle Splitting Method for Biobjective Mixed Integer Programming","authors":"N. Boland, H. Charkhgard, M. Savelsbergh","doi":"10.1007/978-3-319-07557-0_14","DOIUrl":"https://doi.org/10.1007/978-3-319-07557-0_14","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127337612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信