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

Conference on Integer Programming and Combinatorial Optimization最新文献

筛选
英文 中文
Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector 数量平衡就像闵可夫斯基定理和最短向量一样难
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-11-26 DOI: 10.1007/978-3-319-59250-3_21
R. Hoberg, Harishchandra Ramadas, T. Rothvoss, Xin Yang
{"title":"Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector","authors":"R. Hoberg, Harishchandra Ramadas, T. Rothvoss, Xin Yang","doi":"10.1007/978-3-319-59250-3_21","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_21","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115283344","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
Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method 基于乘法权值更新方法的确定性差异最小化
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-11-26 DOI: 10.1007/978-3-319-59250-3_31
A. Levy, Harishchandra Ramadas, T. Rothvoss
{"title":"Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method","authors":"A. Levy, Harishchandra Ramadas, T. Rothvoss","doi":"10.1007/978-3-319-59250-3_31","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_31","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122521998","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}
引用次数: 51
The Heterogeneous Capacitated k-Center Problem 异构可容k中心问题
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-11-22 DOI: 10.1007/978-3-319-59250-3_11
Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar
{"title":"The Heterogeneous Capacitated k-Center Problem","authors":"Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar","doi":"10.1007/978-3-319-59250-3_11","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_11","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127543516","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
An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut 一种改进的多路切割c<e:1> - karloff - rabani松弛的完整性间隙
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-11-17 DOI: 10.1007/978-3-319-59250-3_4
Haris Angelidakis, Yury Makarychev, Pasin Manurangsi
{"title":"An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut","authors":"Haris Angelidakis, Yury Makarychev, Pasin Manurangsi","doi":"10.1007/978-3-319-59250-3_4","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_4","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122363653","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}
引用次数: 26
Integrality Gaps of Integer Knapsack Problems 整数背包问题的完整性间隙
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-11-11 DOI: 10.1007/978-3-319-59250-3_3
I. Aliev, M. Henk, Timm Oertel
{"title":"Integrality Gaps of Integer Knapsack Problems","authors":"I. Aliev, M. Henk, Timm Oertel","doi":"10.1007/978-3-319-59250-3_3","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_3","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121737988","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
Stochastic Online Scheduling on Unrelated Machines 非相关机器的随机在线调度
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-11-01 DOI: 10.1007/978-3-319-59250-3_19
Varun Gupta, Benjamin Moseley, M. Uetz, Qiaomin Xie
{"title":"Stochastic Online Scheduling on Unrelated Machines","authors":"Varun Gupta, Benjamin Moseley, M. Uetz, Qiaomin Xie","doi":"10.1007/978-3-319-59250-3_19","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_19","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122184410","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
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time O(1)平摊更新时间下的确定性全动态近似顶点覆盖与分数匹配
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-11-01 DOI: 10.1007/978-3-319-59250-3_8
Sayan Bhattacharya, Deeparnab Chakrabarty, M. Henzinger
{"title":"Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time","authors":"Sayan Bhattacharya, Deeparnab Chakrabarty, M. Henzinger","doi":"10.1007/978-3-319-59250-3_8","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_8","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134099486","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}
引用次数: 43
Adaptive Submodular Ranking 自适应子模块排序
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-06-05 DOI: 10.1007/978-3-319-59250-3_26
P. Kambadur, V. Nagarajan, F. Navidi
{"title":"Adaptive Submodular Ranking","authors":"P. Kambadur, V. Nagarajan, F. Navidi","doi":"10.1007/978-3-319-59250-3_26","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_26","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123175737","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}
引用次数: 11
On the Mixed Binary Representability of Ellipsoidal Regions 关于椭球体区域的混合二进制可表示性
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-06-01 DOI: 10.1007/978-3-319-33461-5_18
Alberto Del Pia, Jeffrey Poskin
{"title":"On the Mixed Binary Representability of Ellipsoidal Regions","authors":"Alberto Del Pia, Jeffrey Poskin","doi":"10.1007/978-3-319-33461-5_18","DOIUrl":"https://doi.org/10.1007/978-3-319-33461-5_18","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"38 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":"129745542","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
On the Quantile Cut Closure of Chance-Constrained Problems 机会约束问题的分位数切闭性
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-06-01 DOI: 10.1007/978-3-319-33461-5_33
Weijun Xie, Shabbir Ahmed
{"title":"On the Quantile Cut Closure of Chance-Constrained Problems","authors":"Weijun Xie, Shabbir Ahmed","doi":"10.1007/978-3-319-33461-5_33","DOIUrl":"https://doi.org/10.1007/978-3-319-33461-5_33","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"88 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":"116484888","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}
引用次数: 3
首页 上一页 下一页 尾页
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学术官方微信