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

International Symposium on Combinatorial Optimization最新文献

筛选
英文 中文
Jointly Optimizing Replica Placement, Requests Distribution and Server Storage Capacity on Content Distribution Networks 内容分发网络中副本放置、请求分发和服务器存储容量的联合优化
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_17
R. Gerhardt, T. Neves, L. Rangel
{"title":"Jointly Optimizing Replica Placement, Requests Distribution and Server Storage Capacity on Content Distribution Networks","authors":"R. Gerhardt, T. Neves, L. Rangel","doi":"10.1007/978-3-319-96151-4_17","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_17","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":"123171777","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
Preemptively Guessing the Center 抢先猜测中心
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_24
C. Konrad, Tigran Tonoyan
{"title":"Preemptively Guessing the Center","authors":"C. Konrad, Tigran Tonoyan","doi":"10.1007/978-3-319-96151-4_24","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_24","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"25 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":"131939678","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
The Next Release Problem: Complexity, Exact Algorithms and Computations 下一个发布问题:复杂性、精确算法和计算
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_3
J. C. Almeida, Felipe de C. Pereira, Marina V. A. Reis, Breno Piva
{"title":"The Next Release Problem: Complexity, Exact Algorithms and Computations","authors":"J. C. Almeida, Felipe de C. Pereira, Marina V. A. Reis, Breno Piva","doi":"10.1007/978-3-319-96151-4_3","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_3","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"598 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":"127520009","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
Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach 寻找最小停止和捕获集:一个整数线性规划方法
International Symposium on Combinatorial Optimization Pub Date : 2018-04-11 DOI: 10.1007/978-3-319-96151-4_34
Alvaro Velasquez, K. Subramani, S. Drager
{"title":"Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach","authors":"Alvaro Velasquez, K. Subramani, S. Drager","doi":"10.1007/978-3-319-96151-4_34","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_34","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"8 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":"128509627","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
Even flying cops should think ahead 即使是飞行警察也应该未雨绸缪
International Symposium on Combinatorial Optimization Pub Date : 2018-01-22 DOI: 10.1007/978-3-319-96151-4_28
A. Martinsson, Florian Meier, P. Schnider, A. Steger
{"title":"Even flying cops should think ahead","authors":"A. Martinsson, Florian Meier, P. Schnider, A. Steger","doi":"10.1007/978-3-319-96151-4_28","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_28","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125595003","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
Characterization and Approximation of Strong General Dual Feasible Functions 强一般对偶可行函数的表征与逼近
International Symposium on Combinatorial Optimization Pub Date : 2018-01-11 DOI: 10.1007/978-3-319-96151-4_23
M. Köppe, Jiawei Wang
{"title":"Characterization and Approximation of Strong General Dual Feasible Functions","authors":"M. Köppe, Jiawei Wang","doi":"10.1007/978-3-319-96151-4_23","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_23","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122952330","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 PTAS for the Time-Invariant Incremental Knapsack Problem 定常增量背包问题的PTAS
International Symposium on Combinatorial Optimization Pub Date : 2017-01-25 DOI: 10.1007/978-3-319-96151-4_14
Yuri Faenza, Igor Malinovic
{"title":"A PTAS for the Time-Invariant Incremental Knapsack Problem","authors":"Yuri Faenza, Igor Malinovic","doi":"10.1007/978-3-319-96151-4_14","DOIUrl":"https://doi.org/10.1007/978-3-319-96151-4_14","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126659999","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}
引用次数: 10
MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover 具有设置结转的富现实世界批量问题的MIP公式
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_11
Filippo Focacci, Fabio Furini, V. Gabrel, D. Godard, Xueying Shen
{"title":"MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover","authors":"Filippo Focacci, Fabio Furini, V. Gabrel, D. Godard, Xueying Shen","doi":"10.1007/978-3-319-45587-7_11","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_11","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"22 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":"125910195","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 Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases 基于切伪基的二次分配问题的一种新的SDP松弛
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_36
Maximilian John, A. Karrenbauer
{"title":"A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases","authors":"Maximilian John, A. Karrenbauer","doi":"10.1007/978-3-319-45587-7_36","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_36","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"12 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":"122894417","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
Two-Level Polytopes with a Prescribed Facet 具有规定Facet的两层多面体
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_25
Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia
{"title":"Two-Level Polytopes with a Prescribed Facet","authors":"Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia","doi":"10.1007/978-3-319-45587-7_25","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_25","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"6 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":"132482258","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}
引用次数: 8
首页 上一页 下一页 尾页
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学术官方微信