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

Conference on Integer Programming and Combinatorial Optimization最新文献

筛选
英文 中文
Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf's Theorem 具有规定解数的整数规划及Doignon-Bell-Scarf定理的一个加权版本
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2014-06-01 DOI: 10.1007/978-3-319-07557-0_4
I. Aliev, J. D. Loera, Q. Louveaux
{"title":"Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf's Theorem","authors":"I. Aliev, J. D. Loera, Q. Louveaux","doi":"10.1007/978-3-319-07557-0_4","DOIUrl":"https://doi.org/10.1007/978-3-319-07557-0_4","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"11 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132336429","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 Simplex Pivoting Rules and Complexity Theory 单纯形旋转规则与复杂性理论
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2014-04-12 DOI: 10.1007/978-3-319-07557-0_2
I. Adler, C. Papadimitriou, A. Rubinstein
{"title":"On Simplex Pivoting Rules and Complexity Theory","authors":"I. Adler, C. Papadimitriou, A. Rubinstein","doi":"10.1007/978-3-319-07557-0_2","DOIUrl":"https://doi.org/10.1007/978-3-319-07557-0_2","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133955427","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}
引用次数: 23
Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators 基于可分离低估量的盒约束混合整数多项式优化
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2014-02-26 DOI: 10.1007/978-3-319-07557-0_17
C. Buchheim, C. D’Ambrosio
{"title":"Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators","authors":"C. Buchheim, C. D’Ambrosio","doi":"10.1007/978-3-319-07557-0_17","DOIUrl":"https://doi.org/10.1007/978-3-319-07557-0_17","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116584921","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
Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time 无爪t-完美图可以在多项式时间内识别
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2013-10-30 DOI: 10.1007/978-3-319-07557-0_34
H. Bruhn, Oliver Schaudt
{"title":"Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time","authors":"H. Bruhn, Oliver Schaudt","doi":"10.1007/978-3-319-07557-0_34","DOIUrl":"https://doi.org/10.1007/978-3-319-07557-0_34","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123023984","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
Facial Structure and Representation of Integer Hulls of Convex Sets 凸集的面结构与整数壳的表示
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2013-03-18 DOI: 10.1007/978-3-642-36694-9_26
Vishnu Narayanan
{"title":"Facial Structure and Representation of Integer Hulls of Convex Sets","authors":"Vishnu Narayanan","doi":"10.1007/978-3-642-36694-9_26","DOIUrl":"https://doi.org/10.1007/978-3-642-36694-9_26","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127248913","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
Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path 路径上不可分流的常完整性间隙LP公式
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2013-03-18 DOI: 10.1007/978-3-642-36694-9_3
A. Anagnostopoulos, F. Grandoni, S. Leonardi, Andreas Wiese
{"title":"Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path","authors":"A. Anagnostopoulos, F. Grandoni, S. Leonardi, Andreas Wiese","doi":"10.1007/978-3-642-36694-9_3","DOIUrl":"https://doi.org/10.1007/978-3-642-36694-9_3","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134506755","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}
引用次数: 22
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property 无爪完美图中的最小团盖及弱Edmonds-Johnson性质
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2013-03-18 DOI: 10.1007/978-3-642-36694-9_8
Flavia Bonomo, G. Oriolo, C. Snels, Gautier Stauffer
{"title":"Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property","authors":"Flavia Bonomo, G. Oriolo, C. Snels, Gautier Stauffer","doi":"10.1007/978-3-642-36694-9_8","DOIUrl":"https://doi.org/10.1007/978-3-642-36694-9_8","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133281052","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
Content Placement via the Exponential Potential Function Method 通过指数势函数方法放置内容
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2013-03-18 DOI: 10.1007/978-3-642-36694-9_5
David Applegate, Aaron Archer, V. Gopalakrishnan, Seungjoon Lee, K. Ramakrishnan
{"title":"Content Placement via the Exponential Potential Function Method","authors":"David Applegate, Aaron Archer, V. Gopalakrishnan, Seungjoon Lee, K. Ramakrishnan","doi":"10.1007/978-3-642-36694-9_5","DOIUrl":"https://doi.org/10.1007/978-3-642-36694-9_5","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115364363","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
Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids 图拟阵和协拟阵的抬升的单商品流算法
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2013-03-18 DOI: 10.1007/978-3-642-36694-9_17
B. Guenin, Leanne Stuive
{"title":"Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids","authors":"B. Guenin, Leanne Stuive","doi":"10.1007/978-3-642-36694-9_17","DOIUrl":"https://doi.org/10.1007/978-3-642-36694-9_17","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117106882","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
Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines 非相关机器上加权完成时间和最小化的逼近配置- lp
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2013-03-18 DOI: 10.1007/978-3-642-36694-9_33
M. Sviridenko, Andreas Wiese
{"title":"Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines","authors":"M. Sviridenko, Andreas Wiese","doi":"10.1007/978-3-642-36694-9_33","DOIUrl":"https://doi.org/10.1007/978-3-642-36694-9_33","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131917969","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
首页 上一页 下一页 尾页
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学术官方微信