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

International Conference on Combinatorial Optimization and Applications最新文献

筛选
英文 中文
On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem 论无记忆策略在k-加拿大旅行者问题中的竞争力
International Conference on Combinatorial Optimization and Applications Pub Date : 2018-12-15 DOI: 10.1007/978-3-030-04651-4_38
Pierre Bergé, Julien Hemery, Arpad Rimmel, J. Tomasik
{"title":"On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem","authors":"Pierre Bergé, Julien Hemery, Arpad Rimmel, J. Tomasik","doi":"10.1007/978-3-030-04651-4_38","DOIUrl":"https://doi.org/10.1007/978-3-030-04651-4_38","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134521171","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
Open-Shop Scheduling for Unit Jobs Under Precedence Constraints 优先级约束下单元作业的开放车间调度
International Conference on Combinatorial Optimization and Applications Pub Date : 2018-12-15 DOI: 10.1007/978-3-030-04651-4_22
An Zhang, Yong Chen, R. Goebel, Guohui Lin
{"title":"Open-Shop Scheduling for Unit Jobs Under Precedence Constraints","authors":"An Zhang, Yong Chen, R. Goebel, Guohui Lin","doi":"10.1007/978-3-030-04651-4_22","DOIUrl":"https://doi.org/10.1007/978-3-030-04651-4_22","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125797946","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
Primal Dual Algorithm for Partial Set Multi-cover 部分集多覆盖的原始对偶算法
International Conference on Combinatorial Optimization and Applications Pub Date : 2018-12-15 DOI: 10.1007/978-3-030-04651-4_25
Yingli Ran, Yishuo Shi, Zhao Zhang
{"title":"Primal Dual Algorithm for Partial Set Multi-cover","authors":"Yingli Ran, Yishuo Shi, Zhao Zhang","doi":"10.1007/978-3-030-04651-4_25","DOIUrl":"https://doi.org/10.1007/978-3-030-04651-4_25","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116702197","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
Network Cost-Sharing Games: Equilibrium Computation and Applications to Election Modeling 网络成本分担博弈:均衡计算及其在选举建模中的应用
International Conference on Combinatorial Optimization and Applications Pub Date : 2018-12-15 DOI: 10.1007/978-3-030-04651-4_49
Rahul Swamy, Timothy Murray, J. Garg
{"title":"Network Cost-Sharing Games: Equilibrium Computation and Applications to Election Modeling","authors":"Rahul Swamy, Timothy Murray, J. Garg","doi":"10.1007/978-3-030-04651-4_49","DOIUrl":"https://doi.org/10.1007/978-3-030-04651-4_49","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130811950","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
Bipartizing with a Matching 用匹配进行两部分分割
International Conference on Combinatorial Optimization and Applications Pub Date : 2018-12-15 DOI: 10.1007/978-3-030-04651-4_14
C. V. Lima, D. Rautenbach, U. Souza, J. Szwarcfiter
{"title":"Bipartizing with a Matching","authors":"C. V. Lima, D. Rautenbach, U. Souza, J. Szwarcfiter","doi":"10.1007/978-3-030-04651-4_14","DOIUrl":"https://doi.org/10.1007/978-3-030-04651-4_14","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122137970","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
Directed Path-Width of Sequence Digraphs 序列有向图的有向路径宽度
International Conference on Combinatorial Optimization and Applications Pub Date : 2018-12-15 DOI: 10.1007/978-3-030-04651-4_6
Frank Gurski, Carolin Rehs, Jochen Rethmann
{"title":"Directed Path-Width of Sequence Digraphs","authors":"Frank Gurski, Carolin Rehs, Jochen Rethmann","doi":"10.1007/978-3-030-04651-4_6","DOIUrl":"https://doi.org/10.1007/978-3-030-04651-4_6","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130363306","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
Sequence Sentential Decision Diagrams 序列句子决策图
International Conference on Combinatorial Optimization and Applications Pub Date : 2018-12-15 DOI: 10.1007/978-3-030-04651-4_40
Shuhei Denzumi
{"title":"Sequence Sentential Decision Diagrams","authors":"Shuhei Denzumi","doi":"10.1007/978-3-030-04651-4_40","DOIUrl":"https://doi.org/10.1007/978-3-030-04651-4_40","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130195006","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
Practical and Easy-to-Understand Card-Based Implementation of Yao's Millionaire Protocol 实用和易于理解的基于卡片的姚的百万富翁协议的实现
International Conference on Combinatorial Optimization and Applications Pub Date : 2018-12-15 DOI: 10.1007/978-3-030-04651-4_17
Daiki Miyahara, Yu-ichi Hayashi, T. Mizuki, H. Sone
{"title":"Practical and Easy-to-Understand Card-Based Implementation of Yao's Millionaire Protocol","authors":"Daiki Miyahara, Yu-ichi Hayashi, T. Mizuki, H. Sone","doi":"10.1007/978-3-030-04651-4_17","DOIUrl":"https://doi.org/10.1007/978-3-030-04651-4_17","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127200326","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
Graph Problems with Obligations 带有义务的图问题
International Conference on Combinatorial Optimization and Applications Pub Date : 2018-12-15 DOI: 10.1007/978-3-030-04651-4_13
A. Cornet, C. Laforest
{"title":"Graph Problems with Obligations","authors":"A. Cornet, C. Laforest","doi":"10.1007/978-3-030-04651-4_13","DOIUrl":"https://doi.org/10.1007/978-3-030-04651-4_13","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125975609","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
An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy 一种有效的有界退化诱导子图枚举算法
International Conference on Combinatorial Optimization and Applications Pub Date : 2018-12-15 DOI: 10.1007/978-3-030-04651-4_3
Kunihiro Wasa, T. Uno
{"title":"An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy","authors":"Kunihiro Wasa, T. Uno","doi":"10.1007/978-3-030-04651-4_3","DOIUrl":"https://doi.org/10.1007/978-3-030-04651-4_3","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128593509","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
首页 上一页 下一页 尾页
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学术官方微信