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

International Symposium on Combinatorial Optimization最新文献

筛选
英文 中文
Maximum Concurrent Flow with Incomplete Data 不完整数据的最大并发流
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_7
Pierre-Olivier Bauguion, C. D’Ambrosio, Leo Liberti
{"title":"Maximum Concurrent Flow with Incomplete Data","authors":"Pierre-Olivier Bauguion, C. D’Ambrosio, Leo Liberti","doi":"10.1007/978-3-319-96151-4_7","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_7","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"53 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":"115863770","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
Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets Lovász-Schrijver由团切集定义的图类上的psd算子
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_35
Annegret K. Wagler
{"title":"Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets","authors":"Annegret K. Wagler","doi":"10.1007/978-3-319-96151-4_35","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_35","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"7 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":"128297568","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
Characterising Chordal Contact B_0 -VPG Graphs 弦接触B_0 -VPG图的表征
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_8
Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, B. Ries
{"title":"Characterising Chordal Contact B_0 -VPG Graphs","authors":"Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, B. Ries","doi":"10.1007/978-3-319-96151-4_8","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_8","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"12 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":"125148561","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 Polyhedral View to Generalized Multiple Domination and Limited Packing 广义多重支配和有限填充的多面体观点
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_30
José Neto
{"title":"A Polyhedral View to Generalized Multiple Domination and Limited Packing","authors":"José Neto","doi":"10.1007/978-3-319-96151-4_30","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_30","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"57 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":"129986531","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
An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problem 分需单货提货旅行商问题的精确算法
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_21
Hipólito Hernández-Pérez, Juan José SALAZAR-GONZÁLEZ
{"title":"An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problem","authors":"Hipólito Hernández-Pérez, Juan José SALAZAR-GONZÁLEZ","doi":"10.1007/978-3-319-96151-4_21","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_21","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"1 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":"130237079","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
Approximating the Caro-Wei Bound for Independent Sets in Graph Streams 图流中独立集Caro-Wei界的逼近
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_9
Graham Cormode, J. Dark, C. Konrad
{"title":"Approximating the Caro-Wei Bound for Independent Sets in Graph Streams","authors":"Graham Cormode, J. Dark, C. Konrad","doi":"10.1007/978-3-319-96151-4_9","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_9","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"114 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":"117081573","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}
引用次数: 7
The Stop Number Minimization Problem: Complexity and Polyhedral Analysis 停止数最小化问题:复杂性和多面体分析
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_6
Mourad Baïou, R. Colares, H. Kerivin
{"title":"The Stop Number Minimization Problem: Complexity and Polyhedral Analysis","authors":"Mourad Baïou, R. Colares, H. Kerivin","doi":"10.1007/978-3-319-96151-4_6","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_6","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"147 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":"132193621","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
Alternating Current Optimal Power Flow with Generator Selection 交流最优潮流与发电机选择
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_31
E. Salgado, A. Scozzari, F. Tardella, Leo Liberti
{"title":"Alternating Current Optimal Power Flow with Generator Selection","authors":"E. Salgado, A. Scozzari, F. Tardella, Leo Liberti","doi":"10.1007/978-3-319-96151-4_31","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_31","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"9 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":"127729319","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
Online Firefighting on Trees 在线消防树上
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_11
Pierre Coupechoux, M. Demange, D. Ellison, B. Jouve
{"title":"Online Firefighting on Trees","authors":"Pierre Coupechoux, M. Demange, D. Ellison, B. Jouve","doi":"10.1007/978-3-319-96151-4_11","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_11","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"20 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":"131404468","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
Compact MILP Formulations for the p-Center Problem p-中心问题的紧凑MILP公式
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_2
Zacharie Alès, S. Elloumi
{"title":"Compact MILP Formulations for the p-Center Problem","authors":"Zacharie Alès, S. Elloumi","doi":"10.1007/978-3-319-96151-4_2","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_2","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"1 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":"116269049","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学术文献互助群
群 号：481959085
Book学术官方微信