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

Conference on Integer Programming and Combinatorial Optimization最新文献

筛选
英文 中文
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time FPT时间下有界树宽最稀疏切问题的2逼近
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2021-11-11 DOI: 10.1007/978-3-031-06901-7_9
Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo
{"title":"A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time","authors":"Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo","doi":"10.1007/978-3-031-06901-7_9","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_9","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124049954","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}
引用次数: 1
Total Dual Dyadicness and Dyadic Generating Sets 全对偶并矢与并矢生成集
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2021-11-10 DOI: 10.1007/978-3-031-06901-7_1
Ahmad Abdi, G'erard Cornu'ejols, B. Guenin, L. Tunçel
{"title":"Total Dual Dyadicness and Dyadic Generating Sets","authors":"Ahmad Abdi, G'erard Cornu'ejols, B. Guenin, L. Tunçel","doi":"10.1007/978-3-031-06901-7_1","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_1","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"34 14","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133169211","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}
引用次数: 1
Improving the Cook et al. Proximity Bound Given Integral Valued Constraints 改进Cook等。给定积分约束的邻近界
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2021-11-02 DOI: 10.1007/978-3-031-06901-7_7
Marcel Celaya, Stefan Kuhlmann, Joseph Paat, R. Weismantel
{"title":"Improving the Cook et al. Proximity Bound Given Integral Valued Constraints","authors":"Marcel Celaya, Stefan Kuhlmann, Joseph Paat, R. Weismantel","doi":"10.1007/978-3-031-06901-7_7","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_7","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115202204","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
Approximate $mathrm {CVP}_{}$ in Time 20.802 n - Now in Any Norm! 近似$ mathm {CVP}_{}$在时间20.802 n -现在在任何规范!
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2021-10-05 DOI: 10.1007/978-3-031-06901-7_33
T. Rothvoss, Moritz Venzin
{"title":"Approximate $mathrm {CVP}_{}$ in Time 20.802 n - Now in Any Norm!","authors":"T. Rothvoss, Moritz Venzin","doi":"10.1007/978-3-031-06901-7_33","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_33","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122637226","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}
引用次数: 0
ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation 精确最大流量计算的多项式大小的ReLU神经网络
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2021-02-12 DOI: 10.1007/978-3-031-32726-1_14
Christoph Hertrich, Leon Sering
{"title":"ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation","authors":"Christoph Hertrich, Leon Sering","doi":"10.1007/978-3-031-32726-1_14","DOIUrl":"https://doi.org/10.1007/978-3-031-32726-1_14","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"14 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129108281","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
The Secretary Problem with Distributions 秘书分配问题
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2020-12-04 DOI: 10.1007/978-3-031-06901-7_32
Pranav Nuti
{"title":"The Secretary Problem with Distributions","authors":"Pranav Nuti","doi":"10.1007/978-3-031-06901-7_32","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_32","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"252 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115853830","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 Simple Method for Convex Optimization in the Oracle Model Oracle模型凸优化的一种简单方法
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2020-11-17 DOI: 10.1007/978-3-031-06901-7_12
D. Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
{"title":"A Simple Method for Convex Optimization in the Oracle Model","authors":"D. Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge","doi":"10.1007/978-3-031-06901-7_12","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_12","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132524299","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
Faster connectivity in low-rank hypergraphs via expander decomposition 通过扩展器分解在低秩超图中实现更快的连通性
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2020-11-16 DOI: 10.1007/978-3-031-06901-7_6
Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai
{"title":"Faster connectivity in low-rank hypergraphs via expander decomposition","authors":"Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai","doi":"10.1007/978-3-031-06901-7_6","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_6","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125916121","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}
引用次数: 0
Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs 混合整数线性规划通用切割平面的面尺寸
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2020-11-11 DOI: 10.1007/978-3-030-73879-2_28
Matthias Walter
{"title":"Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs","authors":"Matthias Walter","doi":"10.1007/978-3-030-73879-2_28","DOIUrl":"https://doi.org/10.1007/978-3-030-73879-2_28","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132651918","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}
引用次数: 0
On the Power of Static Assignment Policies for Robust Facility Location Problems 鲁棒设施定位问题静态分配策略的威力
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2020-11-10 DOI: 10.1007/978-3-030-73879-2_18
Omar El Housni, Vineet Goyal, D. Shmoys
{"title":"On the Power of Static Assignment Policies for Robust Facility Location Problems","authors":"Omar El Housni, Vineet Goyal, D. Shmoys","doi":"10.1007/978-3-030-73879-2_18","DOIUrl":"https://doi.org/10.1007/978-3-030-73879-2_18","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122778772","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
首页 上一页 下一页 尾页
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学术官方微信