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

Comput. Oper. Res.最新文献

筛选
英文 中文
An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective 从柔性作业车间调度的角度研究广义串行锁调度问题
Comput. Oper. Res. Pub Date : 2021-03-01 DOI: 10.1016/j.cor.2020.105164
Bin Ji, Dezhi Zhang, S. Yu, Xiaoping Fang
{"title":"An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective","authors":"Bin Ji, Dezhi Zhang, S. Yu, Xiaoping Fang","doi":"10.1016/j.cor.2020.105164","DOIUrl":"https://doi.org/10.1016/j.cor.2020.105164","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"2 1","pages":"105164"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74694324","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
A solution framework for the long-term scheduling and inventory management of straight pipeline systems with multiple-sources 多源直管系统长期调度与库存管理的解决方案框架
Comput. Oper. Res. Pub Date : 2021-03-01 DOI: 10.1016/j.cor.2020.105143
William Hitoshi Tsunoda Meira, L. Magatão, Flávio Neves, Lúcia V. R. Arruda, Jonas P. Vaqueiro, S. Relvas, A. Barbosa‐Póvoa
{"title":"A solution framework for the long-term scheduling and inventory management of straight pipeline systems with multiple-sources","authors":"William Hitoshi Tsunoda Meira, L. Magatão, Flávio Neves, Lúcia V. R. Arruda, Jonas P. Vaqueiro, S. Relvas, A. Barbosa‐Póvoa","doi":"10.1016/j.cor.2020.105143","DOIUrl":"https://doi.org/10.1016/j.cor.2020.105143","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"72 1","pages":"105143"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79667855","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}
引用次数: 11
The online vehicle routing problem with occasional drivers 偶尔有司机的在线车辆路线问题
Comput. Oper. Res. Pub Date : 2021-03-01 DOI: 10.1016/J.COR.2020.105144
C. Archetti, F. Guerriero, Giusy Macrina
{"title":"The online vehicle routing problem with occasional drivers","authors":"C. Archetti, F. Guerriero, Giusy Macrina","doi":"10.1016/J.COR.2020.105144","DOIUrl":"https://doi.org/10.1016/J.COR.2020.105144","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"105 1","pages":"105144"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78514644","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}
引用次数: 50
Computing maximum k-defective cliques in massive graphs 计算海量图中最大k-缺陷团
Comput. Oper. Res. Pub Date : 2021-03-01 DOI: 10.1016/j.cor.2020.105131
Xiaoyu Chen, Yi Zhou, Jin-Kao Hao, Jin-Kao Hao, Mingyu Xiao
{"title":"Computing maximum k-defective cliques in massive graphs","authors":"Xiaoyu Chen, Yi Zhou, Jin-Kao Hao, Jin-Kao Hao, Mingyu Xiao","doi":"10.1016/j.cor.2020.105131","DOIUrl":"https://doi.org/10.1016/j.cor.2020.105131","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"45 1","pages":"105131"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77443948","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
The hub location problem with market selection 市场选择下的枢纽选址问题
Comput. Oper. Res. Pub Date : 2021-03-01 DOI: 10.1016/j.cor.2020.105136
Tao Wu, Zhongshun Shi, Canrong Zhang
{"title":"The hub location problem with market selection","authors":"Tao Wu, Zhongshun Shi, Canrong Zhang","doi":"10.1016/j.cor.2020.105136","DOIUrl":"https://doi.org/10.1016/j.cor.2020.105136","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"70 1","pages":"105136"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81793267","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
Maximization of the return on inventory management expense in a system with price- and stock-dependent demand rate 在需求率依赖于价格和库存的系统中，库存管理费用回报的最大化
Comput. Oper. Res. Pub Date : 2021-03-01 DOI: 10.1016/j.cor.2020.105134
V. Pando, L. A. San-José, J. Sicilia, D. D. Pablo
{"title":"Maximization of the return on inventory management expense in a system with price- and stock-dependent demand rate","authors":"V. Pando, L. A. San-José, J. Sicilia, D. D. Pablo","doi":"10.1016/j.cor.2020.105134","DOIUrl":"https://doi.org/10.1016/j.cor.2020.105134","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"23 1","pages":"105134"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89226984","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}
引用次数: 23
Solution approaches for storage loading problems with stacking constraints 具有堆叠约束的存储加载问题的求解方法
Comput. Oper. Res. Pub Date : 2021-03-01 DOI: 10.1016/j.cor.2020.105142
Tobias Oelschlägel, S. Knust
{"title":"Solution approaches for storage loading problems with stacking constraints","authors":"Tobias Oelschlägel, S. Knust","doi":"10.1016/j.cor.2020.105142","DOIUrl":"https://doi.org/10.1016/j.cor.2020.105142","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"21 1","pages":"105142"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75477850","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
Models and algorithms for the product pricing with single-minded customers requesting bundles 针对要求捆绑的单一客户的产品定价模型和算法
Comput. Oper. Res. Pub Date : 2021-03-01 DOI: 10.1016/J.COR.2020.105139
Víctor Bucarey, S. Elloumi, M. Labbé, Fränk Plein
{"title":"Models and algorithms for the product pricing with single-minded customers requesting bundles","authors":"Víctor Bucarey, S. Elloumi, M. Labbé, Fränk Plein","doi":"10.1016/J.COR.2020.105139","DOIUrl":"https://doi.org/10.1016/J.COR.2020.105139","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"138 1","pages":"105139"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77959587","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
A multi-commodity two-Echelon capacitated vehicle routing problem with time windows: Model formulations and solution approach 带时间窗的多商品两梯队车辆路径问题:模型公式与求解方法
Comput. Oper. Res. Pub Date : 2021-03-01 DOI: 10.1016/j.cor.2020.105154
N. Dellaert, T. Woensel, T. Crainic, Fardin Dashty Saridarq
{"title":"A multi-commodity two-Echelon capacitated vehicle routing problem with time windows: Model formulations and solution approach","authors":"N. Dellaert, T. Woensel, T. Crainic, Fardin Dashty Saridarq","doi":"10.1016/j.cor.2020.105154","DOIUrl":"https://doi.org/10.1016/j.cor.2020.105154","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"56 1","pages":"105154"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84773397","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}
引用次数: 21
Multistart search for the Cyclic Cutwidth Minimization Problem 循环切口宽度最小化问题的多起点搜索
Comput. Oper. Res. Pub Date : 2021-02-01 DOI: 10.1016/j.cor.2020.105116
Sergio Cavero, Eduardo G. Pardo, M. Laguna, A. Duarte
{"title":"Multistart search for the Cyclic Cutwidth Minimization Problem","authors":"Sergio Cavero, Eduardo G. Pardo, M. Laguna, A. Duarte","doi":"10.1016/j.cor.2020.105116","DOIUrl":"https://doi.org/10.1016/j.cor.2020.105116","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"4 1","pages":"105116"},"PeriodicalIF":0.0,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84396187","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
首页 上一页 下一页 尾页
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学术官方微信