Comput. Oper. Res.最新文献

筛选
英文 中文
The max-out min-in problem: A tool for data analysis max-out - min-in问题:一个数据分析工具
Comput. Oper. Res. Pub Date : 2023-03-01 DOI: 10.2139/ssrn.4073636
J. Cerdeira, M. J. Martins, M. Raydan
{"title":"The max-out min-in problem: A tool for data analysis","authors":"J. Cerdeira, M. J. Martins, M. Raydan","doi":"10.2139/ssrn.4073636","DOIUrl":"https://doi.org/10.2139/ssrn.4073636","url":null,"abstract":"Let N = { 1 , 2 , . . . , n } be a set of entities and W = [ w ij ] a non-negative symmetric matrix of weights expressing quantified relations between pairs of elements of N , with w ii = 0, for i = 1 , . . . , n . For S ⊆ N , we define ϕ ( S ) to be the sum of the weights of pairs of elements where an element is in S and the other is in ¯ S = N S , minus the sum of the weights of pairs of elements in S . We consider the problem of finding S ⊆ N for which ϕ ( S ) is maximized. We call this combinatorial optimization problem the max-out min-in problem (MOMIP). In this talk I will present two alternative formulations of MOMIP, discuss the application of MOMIP in the selection of variables in exploratory data analysis and in the identification of clusters in the context of cluster analysis, and report preliminary results of its applicability in priority area selection for species coping with climate change, an urgent issue in Conservation Biology. This is a joint work with Maria Jo˜ao Martins (ISA, ULisboa), Marcos Raydan (CMA, FCT-NOVA) and Diogo Alagador","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"84 1","pages":"106218"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87665695","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
Eco-routing problem for the delivery of perishable products 易腐产品运输的生态路线问题
Comput. Oper. Res. Pub Date : 2023-02-01 DOI: 10.2139/ssrn.4157090
F. Wu, M. Dong
{"title":"Eco-routing problem for the delivery of perishable products","authors":"F. Wu, M. Dong","doi":"10.2139/ssrn.4157090","DOIUrl":"https://doi.org/10.2139/ssrn.4157090","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"18 1","pages":"106198"},"PeriodicalIF":0.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76644517","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 trajectory based heuristic for the planar p-median problem 平面p中值问题的一种基于轨迹的启发式算法
Comput. Oper. Res. Pub Date : 2023-01-01 DOI: 10.2139/ssrn.4276234
Z. Drezner, J. Brimberg, A. Schoebel
{"title":"A trajectory based heuristic for the planar p-median problem","authors":"Z. Drezner, J. Brimberg, A. Schoebel","doi":"10.2139/ssrn.4276234","DOIUrl":"https://doi.org/10.2139/ssrn.4276234","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"18 1","pages":"106296"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91378749","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
Simultaneous predictive maintenance and inventory policy in a continuously monitoring system using simulation optimization 同时预测维护和库存策略在连续监测系统中使用仿真优化
Comput. Oper. Res. Pub Date : 2023-01-01 DOI: 10.2139/ssrn.4076657
Yuanyuan Liu, Kuo-Hao Chang, You-Ying Chen
{"title":"Simultaneous predictive maintenance and inventory policy in a continuously monitoring system using simulation optimization","authors":"Yuanyuan Liu, Kuo-Hao Chang, You-Ying Chen","doi":"10.2139/ssrn.4076657","DOIUrl":"https://doi.org/10.2139/ssrn.4076657","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"139 1","pages":"106146"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79870654","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
Design of survivable wireless backhaul networks with reliability considerations 考虑可靠性的生存性无线回程网络设计
Comput. Oper. Res. Pub Date : 2022-12-01 DOI: 10.2139/ssrn.4051814
M. Raayatpanah, Mahdi Kabiri Beheshtkhah, F. Eshghi, M. Kelarestaghi, Napoleão Nepomuceno
{"title":"Design of survivable wireless backhaul networks with reliability considerations","authors":"M. Raayatpanah, Mahdi Kabiri Beheshtkhah, F. Eshghi, M. Kelarestaghi, Napoleão Nepomuceno","doi":"10.2139/ssrn.4051814","DOIUrl":"https://doi.org/10.2139/ssrn.4051814","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"21 1","pages":"106120"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87735507","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
Resources synchronization in a full truckload pickup and delivery problem: An exact approach 满载皮卡和交付问题中的资源同步:一种精确的方法
Comput. Oper. Res. Pub Date : 2022-12-01 DOI: 10.2139/ssrn.4083326
L. Melchiori, G. Nasini, J. Montagna, G. Corsano
{"title":"Resources synchronization in a full truckload pickup and delivery problem: An exact approach","authors":"L. Melchiori, G. Nasini, J. Montagna, G. Corsano","doi":"10.2139/ssrn.4083326","DOIUrl":"https://doi.org/10.2139/ssrn.4083326","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"25 3 1","pages":"106118"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78119563","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 new formulation and an effective matheuristic for the airport gate assignment problem 机场登机口分配问题的一种新的公式和有效的数学方法
Comput. Oper. Res. Pub Date : 2022-11-01 DOI: 10.2139/ssrn.4032618
Özlem Karsu, O. Solyalı
{"title":"A new formulation and an effective matheuristic for the airport gate assignment problem","authors":"Özlem Karsu, O. Solyalı","doi":"10.2139/ssrn.4032618","DOIUrl":"https://doi.org/10.2139/ssrn.4032618","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"142 1","pages":"106073"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80164462","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
Integrating data augmentation and hybrid feature selection for small sample credit risk assessment with high dimensionality 基于数据增强和混合特征选择的小样本高维信用风险评估
Comput. Oper. Res. Pub Date : 2022-07-01 DOI: 10.1016/j.cor.2022.105937
Xiaoming Zhang, Lean Yu, Hang Yin, K. Lai
{"title":"Integrating data augmentation and hybrid feature selection for small sample credit risk assessment with high dimensionality","authors":"Xiaoming Zhang, Lean Yu, Hang Yin, K. Lai","doi":"10.1016/j.cor.2022.105937","DOIUrl":"https://doi.org/10.1016/j.cor.2022.105937","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"53 1","pages":"105937"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79743181","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 dynamic scheduling process and methodology using route deviations and synchronized passenger transfers for flexible feeder transit services 灵活接驳运输服务中使用路线偏差和同步乘客转移的动态调度过程和方法
Comput. Oper. Res. Pub Date : 2022-06-01 DOI: 10.1016/j.cor.2022.105917
Liya Yang, Pan Shang, Yu Yao, Ziling Zeng
{"title":"A dynamic scheduling process and methodology using route deviations and synchronized passenger transfers for flexible feeder transit services","authors":"Liya Yang, Pan Shang, Yu Yao, Ziling Zeng","doi":"10.1016/j.cor.2022.105917","DOIUrl":"https://doi.org/10.1016/j.cor.2022.105917","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"15 1","pages":"105917"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86032420","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
Evolutionary optimisation of large-scale activity clustering with increased automation 自动化程度提高的大规模活动聚类的进化优化
Comput. Oper. Res. Pub Date : 2022-06-01 DOI: 10.1016/j.cor.2022.105925
D. Beer, J. Joubert
{"title":"Evolutionary optimisation of large-scale activity clustering with increased automation","authors":"D. Beer, J. Joubert","doi":"10.1016/j.cor.2022.105925","DOIUrl":"https://doi.org/10.1016/j.cor.2022.105925","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"2014 1","pages":"105925"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82610104","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
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学术官方微信