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

International Symposium on Combinatorial Optimization最新文献

筛选
英文 中文
The Parity Hamiltonian Cycle Problem in Directed Graphs 有向图中的奇偶性哈密顿循环问题
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_5
H. Nishiyama, Yukiko Yamauchi, S. Kijima, M. Yamashita
{"title":"The Parity Hamiltonian Cycle Problem in Directed Graphs","authors":"H. Nishiyama, Yukiko Yamauchi, S. Kijima, M. Yamashita","doi":"10.1007/978-3-319-45587-7_5","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_5","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115526556","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
Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut 具有优先约束的不相关并行机调度问题:多面体分析与分支切割
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_27
Mohammed-Albarra Hassan Abdel-Jabbar, I. Kacem, Sébastien Martin, I. Osman
{"title":"Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut","authors":"Mohammed-Albarra Hassan Abdel-Jabbar, I. Kacem, Sébastien Martin, I. Osman","doi":"10.1007/978-3-319-45587-7_27","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_27","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123496903","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
Scheduling Personnel Retraining: Column Generation Heuristics 安排人员再培训:列生成启发式
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_19
Oliver G. Czibula, Hanyu Gu, Y. Zinder
{"title":"Scheduling Personnel Retraining: Column Generation Heuristics","authors":"Oliver G. Czibula, Hanyu Gu, Y. Zinder","doi":"10.1007/978-3-319-45587-7_19","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_19","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128014264","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
Optimum Solution of the Closest String Problem via Rank Distance 基于秩距离的最近弦问题的最优解
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_26
C. Arbib, G. Felici, Mara Servilio, P. Ventura
{"title":"Optimum Solution of the Closest String Problem via Rank Distance","authors":"C. Arbib, G. Felici, Mara Servilio, P. Ventura","doi":"10.1007/978-3-319-45587-7_26","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_26","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123546536","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 Claw-Free Graphs Lovász-Schrijver无爪图的psd算子
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_6
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret Wagler
{"title":"Lovász-Schrijver PSD-Operator on Claw-Free Graphs","authors":"Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret Wagler","doi":"10.1007/978-3-319-45587-7_6","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_6","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130763253","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
Optimization Models for Multi-period Railway Rolling Stock Assignment 铁路多周期车辆配置优化模型
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_34
S. Morito, Yuho Takehi, Jun Imaizumi, T. Shiina
{"title":"Optimization Models for Multi-period Railway Rolling Stock Assignment","authors":"S. Morito, Yuho Takehi, Jun Imaizumi, T. Shiina","doi":"10.1007/978-3-319-45587-7_34","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_34","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"34 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131958305","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 Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix 与赋值矩阵的最低非零行索引相关的多面体的完整描述
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_2
W. Ben-Ameur, A. Glorieux, José Neto
{"title":"A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix","authors":"W. Ben-Ameur, A. Glorieux, José Neto","doi":"10.1007/978-3-319-45587-7_2","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_2","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127863738","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
Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories 库存中联合订单分批和拣选机路径问题的建模与求解
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_8
C. A. Valle, J. Beasley, A. S. Cunha
{"title":"Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories","authors":"C. A. Valle, J. Beasley, A. S. Cunha","doi":"10.1007/978-3-319-45587-7_8","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_8","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128530839","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}
引用次数: 15
Benders Decomposition for Capacitated Network Design 容量网络设计中的弯曲点分解
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_7
S. Mattia
{"title":"Benders Decomposition for Capacitated Network Design","authors":"S. Mattia","doi":"10.1007/978-3-319-45587-7_7","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_7","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124384651","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 Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness 多端顶点分离问题:多面体表征和tdi性
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_28
Youcef Magnouche, Sébastien Martin
{"title":"The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness","authors":"Youcef Magnouche, Sébastien Martin","doi":"10.1007/978-3-319-45587-7_28","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_28","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121116830","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学术官方微信