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

International Symposium on Combinatorial Optimization最新文献

筛选
英文 中文
A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks 多堆双旅行商问题的集覆盖方法
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_23
M. Barbato, Roland Grappe, M. Lacroix, R. W. Calvo
{"title":"A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks","authors":"M. Barbato, Roland Grappe, M. Lacroix, R. W. Calvo","doi":"10.1007/978-3-319-45587-7_23","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_23","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"7 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":"127762199","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
Integrated Production Scheduling and Delivery Routing: Complexity Results and Column Generation 集成生产调度和交货路线:复杂性结果和列生成
International Symposium on Combinatorial Optimization Pub Date : 2016-05-16 DOI: 10.1007/978-3-319-45587-7_38
Azeddine Cheref, C. Artigues, J. Billaut, Sandra Ulrich Ngueveu
{"title":"Integrated Production Scheduling and Delivery Routing: Complexity Results and Column Generation","authors":"Azeddine Cheref, C. Artigues, J. Billaut, Sandra Ulrich Ngueveu","doi":"10.1007/978-3-319-45587-7_38","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_38","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"33 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":"127878922","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
Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems 切平面定理的计算机辅助发现与自动证明
International Symposium on Combinatorial Optimization Pub Date : 2016-04-13 DOI: 10.1007/978-3-319-45587-7_29
M. Köppe, Yuan Zhou
{"title":"Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems","authors":"M. Köppe, Yuan Zhou","doi":"10.1007/978-3-319-45587-7_29","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_29","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126827683","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
A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs 求解非凸二次整数规划半定松弛的坐标上升法
International Symposium on Combinatorial Optimization Pub Date : 2016-03-08 DOI: 10.1007/978-3-319-45587-7_10
C. Buchheim, M. Montenegro, Angelika Wiegele
{"title":"A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs","authors":"C. Buchheim, M. Montenegro, Angelika Wiegele","doi":"10.1007/978-3-319-45587-7_10","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_10","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121087950","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
Exact Solution Methods for the k-Item Quadratic Knapsack Problem k项二次背包问题的精确解方法
International Symposium on Combinatorial Optimization Pub Date : 2016-02-17 DOI: 10.1007/978-3-319-45587-7_15
Lucas Létocart, Angelika Wiegele
{"title":"Exact Solution Methods for the k-Item Quadratic Knapsack Problem","authors":"Lucas Létocart, Angelika Wiegele","doi":"10.1007/978-3-319-45587-7_15","DOIUrl":"https://doi.org/10.1007/978-3-319-45587-7_15","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121074638","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
Active Set Methods with Reoptimization for Convex Quadratic Integer Programming 凸二次整数规划的活动集再优化方法
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_11
C. Buchheim, Long Trieu
{"title":"Active Set Methods with Reoptimization for Convex Quadratic Integer Programming","authors":"C. Buchheim, Long Trieu","doi":"10.1007/978-3-319-09174-7_11","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_11","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116908658","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
k -Packing Functions of Graphs 图的填充函数
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_28
V. Leoni, Erica G. Hinrichsen
{"title":"k -Packing Functions of Graphs","authors":"V. Leoni, Erica G. Hinrichsen","doi":"10.1007/978-3-319-09174-7_28","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_28","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116915145","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}
引用次数: 9
Lovász and Schrijver N_+ -Relaxation on Web Graphs Lovász和Schrijver N_+ - relax on Web Graphs
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_19
M. Escalante, G. Nasini
{"title":"Lovász and Schrijver N_+ -Relaxation on Web Graphs","authors":"M. Escalante, G. Nasini","doi":"10.1007/978-3-319-09174-7_19","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_19","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"28 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120820085","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
An Integer Programming Formulation for the Maximum k-Subset Intersection Problem 最大k子集交问题的一个整数规划公式
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_8
Eduardo T. Bogue, C. C. Souza, E. C. Xavier, A. Freire
{"title":"An Integer Programming Formulation for the Maximum k-Subset Intersection Problem","authors":"Eduardo T. Bogue, C. C. Souza, E. C. Xavier, A. Freire","doi":"10.1007/978-3-319-09174-7_8","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_8","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130623154","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
Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures 参数多路由流及其在k边故障鲁棒网络中的应用
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_3
Jean-François Baffier, Vorapong Suppakitpaisarn, H. Hiraishi, H. Imai
{"title":"Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures","authors":"Jean-François Baffier, Vorapong Suppakitpaisarn, H. Hiraishi, H. Imai","doi":"10.1007/978-3-319-09174-7_3","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_3","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130693588","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
首页 上一页 下一页 尾页
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学术官方微信