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

International Symposium on Combinatorial Optimization最新文献

筛选
英文 中文
Solving a Real-World Multi-attribute VRP Using a Primal-Based Approach 用基于原始的方法求解现实世界中的多属性VRP
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_24
M. Messaoudi, Issmail Elhallaoui, Louis-Martin Rousseau, Adil Tahir
{"title":"Solving a Real-World Multi-attribute VRP Using a Primal-Based Approach","authors":"M. Messaoudi, Issmail Elhallaoui, Louis-Martin Rousseau, Adil Tahir","doi":"10.1007/978-3-030-53262-8_24","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_24","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115713351","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
On the Multiple Steiner Traveling Salesman Problem with Order Constraints 带订单约束的多重Steiner旅行商问题
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_6
Raouia Taktak, Eduardo Uchoa
{"title":"On the Multiple Steiner Traveling Salesman Problem with Order Constraints","authors":"Raouia Taktak, Eduardo Uchoa","doi":"10.1007/978-3-030-53262-8_6","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_6","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127049178","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
Handling Separable Non-convexities Using Disjunctive Cuts 用析取切割处理可分离非凸
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_9
C. D’Ambrosio, Jon Lee, Daphne E. Skipper, D. Thomopulos
{"title":"Handling Separable Non-convexities Using Disjunctive Cuts","authors":"C. D’Ambrosio, Jon Lee, Daphne E. Skipper, D. Thomopulos","doi":"10.1007/978-3-030-53262-8_9","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_9","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121496862","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
Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions 拼车系统的动态和随机再匹配:公式和缩减
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_16
Gabriel Homsi, B. Gendron, S. D. Jena
{"title":"Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions","authors":"Gabriel Homsi, B. Gendron, S. D. Jena","doi":"10.1007/978-3-030-53262-8_16","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_16","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127223818","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
On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs 关于k边连通多面体:级数-平行图中的盒性
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_3
M. Barbato, Roland Grappe, M. Lacroix, Emiliano Lancini
{"title":"On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs","authors":"M. Barbato, Roland Grappe, M. Lacroix, Emiliano Lancini","doi":"10.1007/978-3-030-53262-8_3","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_3","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115441710","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
On the Linear Relaxation of the s-t-cut Problem with Budget Constraints 预算约束下s-t-切问题的线性松弛
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_7
Hassene Aissi, A. Mahjoub
{"title":"On the Linear Relaxation of the s-t-cut Problem with Budget Constraints","authors":"Hassene Aissi, A. Mahjoub","doi":"10.1007/978-3-030-53262-8_7","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_7","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114833475","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
Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs 图中开放定位控制集与定位总控制集相关的多面体
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_1
G. Argiroffo, S. Bianchi, Yanina Lucarini, Annegret K. Wagler
{"title":"Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs","authors":"G. Argiroffo, S. Bianchi, Yanina Lucarini, Annegret K. Wagler","doi":"10.1007/978-3-030-53262-8_1","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_1","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127530369","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
Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes 不相同作业规模的并行批处理机器调度的圆弧流方法
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_15
Renan Spencer Trindade, O. Araújo, M. Fampa
{"title":"Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes","authors":"Renan Spencer Trindade, O. Araújo, M. Fampa","doi":"10.1007/978-3-030-53262-8_15","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_15","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124185334","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
The Knapsack Problem with Forfeits 罚金的背包问题
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_22
R. Cerulli, C. D’Ambrosio, A. Raiconi, Gaetano Vitale
{"title":"The Knapsack Problem with Forfeits","authors":"R. Cerulli, C. D’Ambrosio, A. Raiconi, Gaetano Vitale","doi":"10.1007/978-3-030-53262-8_22","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_22","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131762668","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
On the p-Median Polytope and the Directed Odd Cycle Inequalities 关于p-中位多面体和有向奇环不等式
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_2
Mourad Baïou, F. Barahona
{"title":"On the p-Median Polytope and the Directed Odd Cycle Inequalities","authors":"Mourad Baïou, F. Barahona","doi":"10.1007/978-3-030-53262-8_2","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_2","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133104142","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
首页 上一页 下一页 尾页
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学术官方微信