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

Conference on Integer Programming and Combinatorial Optimization最新文献

筛选
英文 中文
Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization 打破1 - 1/e屏障，实现非抢占式吞吐量最大化
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2020-07-30 DOI: 10.1007/978-3-319-59250-3_24
Sungjin Im, Shi Li, Benjamin Moseley
{"title":"Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization","authors":"Sungjin Im, Shi Li, Benjamin Moseley","doi":"10.1007/978-3-319-59250-3_24","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_24","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"238 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127052317","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}
引用次数: 2
A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering 电容循环覆盖的快速(2 + 2/7)逼近算法
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2020-06-08 DOI: 10.1007/978-3-030-45771-6_30
Vera Traub, Thorben Tröbst
{"title":"A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering","authors":"Vera Traub, Thorben Tröbst","doi":"10.1007/978-3-030-45771-6_30","DOIUrl":"https://doi.org/10.1007/978-3-030-45771-6_30","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132789576","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}
引用次数: 2
Implementing Automatic Benders Decomposition in a Modern MIP Solver 在现代MIP求解器中实现自动弯管机分解
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2020-06-08 DOI: 10.1007/978-3-030-45771-6_7
Pierre Bonami, Domenico Salvagnin, Andrea Tramontani
{"title":"Implementing Automatic Benders Decomposition in a Modern MIP Solver","authors":"Pierre Bonami, Domenico Salvagnin, Andrea Tramontani","doi":"10.1007/978-3-030-45771-6_7","DOIUrl":"https://doi.org/10.1007/978-3-030-45771-6_7","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"301 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130718288","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}
引用次数: 17
Graph Coloring Lower Bounds from Decision Diagrams 决策图的图着色下界
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2020-06-08 DOI: 10.1007/978-3-030-45771-6_31
W. V. Hoeve
{"title":"Graph Coloring Lower Bounds from Decision Diagrams","authors":"W. V. Hoeve","doi":"10.1007/978-3-030-45771-6_31","DOIUrl":"https://doi.org/10.1007/978-3-030-45771-6_31","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114665410","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
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables 带指示变量的约束二次优化问题的凸化问题
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2020-06-08 DOI: 10.1007/978-3-030-45771-6_33
Linchuan Wei, A. Gómez, Simge Küçükyavuz
{"title":"On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables","authors":"Linchuan Wei, A. Gómez, Simge Küçükyavuz","doi":"10.1007/978-3-030-45771-6_33","DOIUrl":"https://doi.org/10.1007/978-3-030-45771-6_33","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114958470","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
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts 参数化全局最小切割下一个断点和最大值的快速算法
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2020-06-08 DOI: 10.1007/978-3-030-45771-6_3
Hassene Aissi, S. McCormick, M. Queyranne
{"title":"Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts","authors":"Hassene Aissi, S. McCormick, M. Queyranne","doi":"10.1007/978-3-030-45771-6_3","DOIUrl":"https://doi.org/10.1007/978-3-030-45771-6_3","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125435004","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}
引用次数: 5
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation 整数平面多流最大化:流切间隙和四分之一近似
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2020-02-25 DOI: 10.1007/978-3-030-45771-6_12
Naveen Garg, Nikhil Kumar, Andr'as SebHo
{"title":"Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation","authors":"Naveen Garg, Nikhil Kumar, Andr'as SebHo","doi":"10.1007/978-3-030-45771-6_12","DOIUrl":"https://doi.org/10.1007/978-3-030-45771-6_12","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131891581","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}
引用次数: 6
On Convex Hulls of Epigraphs of QCQPs 论qcqp题词的凸壳
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2020-02-04 DOI: 10.1007/978-3-030-45771-6_32
Alex L. Wang, F. Kılınç-Karzan
{"title":"On Convex Hulls of Epigraphs of QCQPs","authors":"Alex L. Wang, F. Kılınç-Karzan","doi":"10.1007/978-3-030-45771-6_32","DOIUrl":"https://doi.org/10.1007/978-3-030-45771-6_32","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122010224","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
Optimizing Sparsity over Lattices and Semigroups 优化格和半群的稀疏性
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2019-12-20 DOI: 10.1007/978-3-030-45771-6_4
I. Aliev, G. Averkov, J. D. Loera, Timm Oertel
{"title":"Optimizing Sparsity over Lattices and Semigroups","authors":"I. Aliev, G. Averkov, J. D. Loera, Timm Oertel","doi":"10.1007/978-3-030-45771-6_4","DOIUrl":"https://doi.org/10.1007/978-3-030-45771-6_4","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132604036","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
Improved Approximation Algorithms for Inventory Problems 库存问题的改进逼近算法
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2019-11-30 DOI: 10.1007/978-3-030-45771-6_8
T. Bosman, Neil Olver
{"title":"Improved Approximation Algorithms for Inventory Problems","authors":"T. Bosman, Neil Olver","doi":"10.1007/978-3-030-45771-6_8","DOIUrl":"https://doi.org/10.1007/978-3-030-45771-6_8","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122236562","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}
引用次数: 4
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信