Annals of Operations Research最新文献_第6页

Partition of graphs with maximum degree ratio 最大度比图的划分

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-07 DOI: 10.1007/s10479-025-06615-7

Valentin Bouquet, François Delbot, Christophe Picouleau

引用次数: 0

Reliability management with applications in smart information systems 可靠性管理在智能信息系统中的应用

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-06 DOI: 10.1007/s10479-025-06639-z

Cheng-Fu Huang, Ping-Chen Chang

引用次数: 0

On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms 关于k-最大不相交加权生成树问题：变量、复杂度和算法

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-06 DOI: 10.1007/s10479-025-06592-x

Walid Astaoui, Youcef Magnouche, Sébastien Martin

{"title":"On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms","authors":"Walid Astaoui, Youcef Magnouche, Sébastien Martin","doi":"10.1007/s10479-025-06592-x","DOIUrl":"10.1007/s10479-025-06592-x","url":null,"abstract":"<div>Let us consider a connected undirected graph (G = (V, E,d,w)) with a set of nodes V, a set of edges E, an edge distance vector d, and an edge weight vector w. For a given integer (k ge 2), we investigate the problem of finding k-maximally weighted edge-disjoint spanning trees (S_1,S_2ldots S_k), where (S_isubseteq E), (iin {1,dots , k}). Given k root nodes (r_1,ldots r_k in V), we also impose additional constraints, leading to two new variants: (1) (S_1) must be a shortest-path tree, with respect to d, rooted on (r_1) and 2) all trees must be shortest-path trees, with respect to d, rooted on (r_1,ldots r_k), respectively. We consider two different objective functions: (1) the weight of (S_1) is minimum, and (2) the total weight of (S_1,dots , S_k) is minimum. We show that each variant belongs to (mathcal {P}) class for some values of k. This leads to exact polynomial matroid-based algorithms. We present and discuss the numerical results for every variant, and analyze the properties of the trees returned by the algorithms.</div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"351 1","pages":"849 - 881"},"PeriodicalIF":4.5,"publicationDate":"2025-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145163037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Column-and-constraint generation approach to partition-based risk-averse two-stage stochastic programs 基于分区的风险规避两阶段随机规划的列约束生成方法

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-06 DOI: 10.1007/s10479-025-06617-5

Jongheon Lee, Kyungsik Lee

{"title":"Column-and-constraint generation approach to partition-based risk-averse two-stage stochastic programs","authors":"Jongheon Lee, Kyungsik Lee","doi":"10.1007/s10479-025-06617-5","DOIUrl":"10.1007/s10479-025-06617-5","url":null,"abstract":"<div>Typically, two-stage stochastic programs have been modeled and solved based on the finite support assumption, but the large number of scenarios makes it hard to solve, and there also are potential risks of inaccurate estimation of underlying distribution. In this paper, to mitigate the drawbacks, we present a novel risk-averse two-stage stochastic program with finite support, which we call partition-based risk-averse two-stage stochastic program. In the program, a set of scenarios is partitioned into several groups, and the second-stage cost is defined as the expectation of risk levels for all of the groups. In particular, the conditional value-at-risk is considered as a risk measure for each group, and so the risk level of the model is affected by a quantile parameter or a partition of a given set of scenarios. In order to solve the model exactly for a given partition, a column-and-constraint generation algorithm is proposed. In addition, a scenario partitioning algorithm to enable the risk level of the model to be close to a given target is devised, and partitioning schemes for combining it with the proposed column-and-constraint generation algorithm are proposed. Extensive numerical experiments were performed that demonstrated the effectiveness of the proposed partitioning schemes and the efficiency of the proposed solution approach.</div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"349 3","pages":"1717 - 1747"},"PeriodicalIF":4.5,"publicationDate":"2025-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-025-06617-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145162759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A generalization to networks of Young’s characterization of the Borda rule 将杨的波达规则的特征推广到网络

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-02 DOI: 10.1007/s10479-025-06593-w

Daniela Bubboloni, Michele Gori

{"title":"A generalization to networks of Young’s characterization of the Borda rule","authors":"Daniela Bubboloni, Michele Gori","doi":"10.1007/s10479-025-06593-w","DOIUrl":"10.1007/s10479-025-06593-w","url":null,"abstract":"<div>We prove that, for any given set of networks satisfying suitable conditions, the net-oudegree network solution, the net-indegree network solution, and the total network solution are the unique network solutions on that set satisfying neutrality, consistency and cancellation. The generality of the result obtained allows to get an analogous result for social choice correspondences: for any given set of preference profiles satisfying suitable conditions, the net-oudegree social choice correspondence, the net-indegree social choice correspondence and the total social choice correspondence are the unique social choice correspondences on that set satisfying neutrality, consistency and cancellation. Using the notable fact that several well-known voting rules coincide with the restriction of the net-outdegree social choice correspondence to appropriate sets of preference profiles, we are able to deduce a variety of new and known characterization theorems for the Borda rule, the Partial Borda rule, the Averaged Borda rule, the Approval Voting, the Plurality rule and the anti-Plurality rule, among which Young’s characterization of the Borda rule and Fishburn’s characterization of the Approval Voting.</div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"349 3","pages":"1501 - 1552"},"PeriodicalIF":4.5,"publicationDate":"2025-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-025-06593-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145161186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On using fuzzy clustering for detecting the number of states in Markov switching models 用模糊聚类检测马尔可夫切换模型的状态数

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-02 DOI: 10.1007/s10479-025-06585-w

Edoardo Otranto, Luca Scaffidi Domianello

引用次数: 0

Fresh agricultural products logistics network optimization incorporating departure time under the origin e-commerce model 原产地电子商务模式下包含出发时间的生鲜农产品物流网络优化

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-01 DOI: 10.1007/s10479-025-06622-8

Qunli Yuchi, Wenjing Liao, Juhong Chen

引用次数: 0

Social optimum in public transport networks when users choose strategies: analysis and comparison with Wardrop equilibrium 用户选择策略时公共交通网络的社会最优：与Wardrop均衡的分析与比较

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-04-26 DOI: 10.1007/s10479-025-06604-w

Victoria M. Orlando, Iván L. Degano, Pablo A. Lotito

{"title":"Social optimum in public transport networks when users choose strategies: analysis and comparison with Wardrop equilibrium","authors":"Victoria M. Orlando, Iván L. Degano, Pablo A. Lotito","doi":"10.1007/s10479-025-06604-w","DOIUrl":"10.1007/s10479-025-06604-w","url":null,"abstract":"<div>The effective design and management of public transport systems are essential to ensuring the best service for users. The performance of a transport system will depend heavily on users behavior and decisions. Generally, users have individual objectives, such as seeking to minimize their own travel time. These decisions can affect the performance of the entire system, making it inefficient. A measure that allows to quantify the inefficiency of the system in the face of non-cooperative behavior is the price of anarchy. Our objective is to investigate the price of anarchy in the common-lines problem. In this approach, users choose which lines to use based on the best strategy for them. While Wardrop equilibrium has been studied for the common-lines problem, no contributions have been made toward the social optimum. In this work, we propose two optimization problems to obtain this optimum on simple networks, using strategy flow and line flow formulations. In addition, we prove that both optimization problems are equivalent, and we obtain a characterization of the social optimum flows. These contributions allow us to obtain results about the behavior of the price of anarchy in simple networks as demand increases.</div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"349 3","pages":"1785 - 1815"},"PeriodicalIF":4.5,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145170010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Black–Litterman portfolio optimization based on GARCH–EVT–Copula and LSTM models 基于GARCH-EVT-Copula和LSTM模型的Black-Litterman投资组合优化

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-04-21 DOI: 10.1007/s10479-025-06597-6

Vu Huynh, Bao Quoc Ta

引用次数: 0

A guaranteed service model with continuous review (r,Q) policy 具有连续评审（r，Q）策略的保证服务模型

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-04-21 DOI: 10.1007/s10479-025-06550-7

Abderrahim Bendadou, Yacine Rekik, Rim Kalaï, Zied Jemai

引用次数: 0