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

International Symposium on Combinatorial Optimization最新文献

筛选
英文 中文
Polytope Membership in High Dimension 高维多面体隶属度
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_4
Evangelos Anagnostopoulos, I. Emiris, Vissarion Fisikopoulos
{"title":"Polytope Membership in High Dimension","authors":"Evangelos Anagnostopoulos, I. Emiris, Vissarion Fisikopoulos","doi":"10.1007/978-3-319-96151-4_4","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_4","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"62 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":"128596061","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
Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs 固有区间图中k-支配和总k-支配的改进算法
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_25
Nina Chiarelli, Tatiana Romina Hartinger, V. Leoni, Maria Inés Lopez Pujato, Martin Milanič
{"title":"Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs","authors":"Nina Chiarelli, Tatiana Romina Hartinger, V. Leoni, Maria Inés Lopez Pujato, Martin Milanič","doi":"10.1007/978-3-319-96151-4_25","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_25","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":"130956442","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
Descent with Mutations Applied to the Linear Ordering Problem 突变下降法在线性排序问题中的应用
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_22
O. Hudry
{"title":"Descent with Mutations Applied to the Linear Ordering Problem","authors":"O. Hudry","doi":"10.1007/978-3-319-96151-4_22","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_22","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"17 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":"125185933","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 Multigraph Formulation for the Generalized Minimum Spanning Tree Problem 广义最小生成树问题的一个多图表达式
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_12
Ernando Gomes de Sousa, R. Andrade, A. C. Santos
{"title":"A Multigraph Formulation for the Generalized Minimum Spanning Tree Problem","authors":"Ernando Gomes de Sousa, R. Andrade, A. C. Santos","doi":"10.1007/978-3-319-96151-4_12","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_12","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":"131807769","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
An Exact Column Generation-Based Algorithm for Bi-objective Vehicle Routing Problems 基于精确列生成的双目标车辆路径问题算法
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_18
Estèle Glize, Nicolas Jozefowiez, Sandra Ulrich Ngueveu
{"title":"An Exact Column Generation-Based Algorithm for Bi-objective Vehicle Routing Problems","authors":"Estèle Glize, Nicolas Jozefowiez, Sandra Ulrich Ngueveu","doi":"10.1007/978-3-319-96151-4_18","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_18","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"41 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":"121686550","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
A Branch-and-Bound Procedure for the Robust Cyclic Job Shop Problem 鲁棒循环作业车间问题的分支定界方法
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_20
Idir Hamaz, L. Houssin, S. Cafieri
{"title":"A Branch-and-Bound Procedure for the Robust Cyclic Job Shop Problem","authors":"Idir Hamaz, L. Houssin, S. Cafieri","doi":"10.1007/978-3-319-96151-4_20","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_20","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"16 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":"114969003","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 Generalization of the Minimum Branch Vertices Spanning Tree Problem 最小分支顶点生成树问题的推广
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_29
Massinissa Merabet, J. Desai, M. Molnár
{"title":"A Generalization of the Minimum Branch Vertices Spanning Tree Problem","authors":"Massinissa Merabet, J. Desai, M. Molnár","doi":"10.1007/978-3-319-96151-4_29","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_29","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":"129205514","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
Multi-start Local Search Procedure for the Maximum Fire Risk Insured Capital Problem 最大火灾风险保险资金问题的多起点局部搜索方法
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_19
M. Salema, Lourdes B. Afonso, Nelson Chibeles-Martins, Joana M. Fradinho
{"title":"Multi-start Local Search Procedure for the Maximum Fire Risk Insured Capital Problem","authors":"M. Salema, Lourdes B. Afonso, Nelson Chibeles-Martins, Joana M. Fradinho","doi":"10.1007/978-3-319-96151-4_19","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_19","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"39 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":"127686702","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
The Minimum Rooted-Cycle Cover Problem 最小根循环覆盖问题
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_10
Denis Cornaz, Youcef Magnouche
{"title":"The Minimum Rooted-Cycle Cover Problem","authors":"Denis Cornaz, Youcef Magnouche","doi":"10.1007/978-3-319-96151-4_10","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_10","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"40 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":"127816490","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
A Heuristic for Maximising Energy Efficiency in an OFDMA System Subject to QoS Constraints 受QoS约束的OFDMA系统中能量效率最大化的启发式算法
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_26
Adam N. Letchford, Q. Ni, Z. Zhong
{"title":"A Heuristic for Maximising Energy Efficiency in an OFDMA System Subject to QoS Constraints","authors":"Adam N. Letchford, Q. Ni, Z. Zhong","doi":"10.1007/978-3-319-96151-4_26","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_26","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":"129867160","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学术官方微信