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
设N ={1,2，…， n}是实体的集合，W = [wij]是表示n的元素对之间的量化关系的非负对称权重矩阵，其中W ii = 0，对于i = 1，…，名词;对于S，我们定义φ (S)为一个元素在S中，另一个元素在¯S = N S中的元素对的权值之和，减去S中元素对的权值之和。考虑求出其中φ (S)最大的S≤N的问题。我们称这种组合优化问题为最大输出最小输入问题(MOMIP)。在这次演讲中，我将介绍MOMIP的两种替代公式，讨论MOMIP在探索性数据分析中的变量选择和聚类分析背景下的聚类识别中的应用，并报告其在优先区域选择中适用性的初步结果，以应对气候变化，这是保护生物学的一个紧迫问题。这是与Maria Jo ~ ao Martins (ISA, ULisboa)， Marcos Raydan (CMA, FCT-NOVA)和Diogo Alagador合作的作品
{"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}
{"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}
{"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}
{"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}
{"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}
{"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}
Pub Date : 2022-07-01DOI: 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}
Pub Date : 2022-06-01DOI: 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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：