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

International Symposium on Combinatorial Optimization最新文献

筛选
英文 中文
Quasi-Separable Dantzig-Wolfe Reformulations for Network Design 网络设计的准可分dantzigg - wolfe重构
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_19
A. Frangioni, B. Gendron, E. Gorgone
{"title":"Quasi-Separable Dantzig-Wolfe Reformulations for Network Design","authors":"A. Frangioni, B. Gendron, E. Gorgone","doi":"10.1007/978-3-030-53262-8_19","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_19","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123879304","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
A Polyhedral Study for the Buy-at-Bulk Facility Location Problem 散装采购设施选址问题的多面体研究
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_4
Chaghoub Soraya, I. Diarrassouba
{"title":"A Polyhedral Study for the Buy-at-Bulk Facility Location Problem","authors":"Chaghoub Soraya, I. Diarrassouba","doi":"10.1007/978-3-030-53262-8_4","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_4","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":" 915","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120828622","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
An Efficient Matheuristic for the Inventory Routing Problem 库存路径问题的一种有效数学方法
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_23
Pedro Diniz, R. Martinelli, M. P. D. Aragão
{"title":"An Efficient Matheuristic for the Inventory Routing Problem","authors":"Pedro Diniz, R. Martinelli, M. P. D. Aragão","doi":"10.1007/978-3-030-53262-8_23","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_23","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115316118","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
An Experimental Study of ILP Formulations for the Longest Induced Path Problem 最长诱导路径问题的ILP公式的实验研究
International Symposium on Combinatorial Optimization Pub Date : 2020-02-17 DOI: 10.1007/978-3-030-53262-8_8
Markus Chimani, Fritz Bökler, Mirko H. Wagner, Tilo Wiedera
{"title":"An Experimental Study of ILP Formulations for the Longest Induced Path Problem","authors":"Markus Chimani, Fritz Bökler, Mirko H. Wagner, Tilo Wiedera","doi":"10.1007/978-3-030-53262-8_8","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_8","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128007679","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
Improving Proximity Bounds Using Sparsity 利用稀疏性改进邻近边界
International Symposium on Combinatorial Optimization Pub Date : 2020-01-14 DOI: 10.1007/978-3-030-53262-8_10
Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu
{"title":"Improving Proximity Bounds Using Sparsity","authors":"Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu","doi":"10.1007/978-3-030-53262-8_10","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_10","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114754949","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}
引用次数: 18
The Distance Matching Problem 距离匹配问题
International Symposium on Combinatorial Optimization Pub Date : 2019-11-27 DOI: 10.1007/978-3-030-53262-8_17
Péter Madarasi
{"title":"The Distance Matching Problem","authors":"Péter Madarasi","doi":"10.1007/978-3-030-53262-8_17","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_17","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115262681","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
The Distance Polytope for the Vertex Coloring Problem 顶点着色问题的距离多边形
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_13
Bruno Dias, R. Rodrigues, N. Maculan, J. Marenco
{"title":"The Distance Polytope for the Vertex Coloring Problem","authors":"Bruno Dias, R. Rodrigues, N. Maculan, J. Marenco","doi":"10.1007/978-3-319-96151-4_13","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_13","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122033021","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
2 CSPs All Are Approximable Within a Constant Differential Factor csp在一个恒定的微分因子内都是近似的
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_33
Jean-François Culus, S. Toulouse
{"title":"2 CSPs All Are Approximable Within a Constant Differential Factor","authors":"Jean-François Culus, S. Toulouse","doi":"10.1007/978-3-319-96151-4_33","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_33","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"47 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115943219","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
An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects 具有项目偏好的学生项目分配问题的整数规划方法
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_27
D. Manlove, D. Milne, S. Olaosebikan
{"title":"An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects","authors":"D. Manlove, D. Milne, S. Olaosebikan","doi":"10.1007/978-3-319-96151-4_27","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_27","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122053691","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
Cluster Editing with Vertex Splitting 聚类编辑与顶点分裂
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_1
F. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw
{"title":"Cluster Editing with Vertex Splitting","authors":"F. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw","doi":"10.1007/978-3-319-96151-4_1","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_1","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"54 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125924724","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
首页 上一页 下一页 尾页
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学术官方微信