Operations Research Letters最新文献

筛选
英文 中文
Energy-optimal scheduling with variable processing speed: The role of task size variability 变加工速度下的能量最优调度:任务大小可变性的作用
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-10-01 DOI: 10.1016/j.orl.2025.107379
Jonatha Anselmi, Bruno Gaujal
{"title":"Energy-optimal scheduling with variable processing speed: The role of task size variability","authors":"Jonatha Anselmi,&nbsp;Bruno Gaujal","doi":"10.1016/j.orl.2025.107379","DOIUrl":"10.1016/j.orl.2025.107379","url":null,"abstract":"<div><div>In this paper, we study the execution of a single task with an unknown size on a server with variable processing speed. Our goal is to analyze structural properties of the optimal energy consumption under the optimal speed profile that minimizes the expected energy consumption while meeting a hard deadline constraint. Specifically, we investigate how the task size probability distribution impacts the overall energy.</div><div>Under mild assumptions, our main result shows that the expected energy consumption induced by the optimal speed profile preserves the convex increasing order with respect to the task size distribution. Then, we leverage this property to derive simple bounds and conduct a worst-case analysis. In particular, we derive a simple, general formula for the energy gap induced by the ‘best’ and ‘worst’ task size distributions, expressed in terms of the support and expectation of the task size.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"64 ","pages":"Article 107379"},"PeriodicalIF":0.9,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145222609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A simple approximation algorithm for optimal decision tree 最优决策树的一个简单逼近算法
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-09-25 DOI: 10.1016/j.orl.2025.107370
Zhengjia Zhuo, Viswanath Nagarajan
{"title":"A simple approximation algorithm for optimal decision tree","authors":"Zhengjia Zhuo,&nbsp;Viswanath Nagarajan","doi":"10.1016/j.orl.2025.107370","DOIUrl":"10.1016/j.orl.2025.107370","url":null,"abstract":"<div><div>In the optimal decision tree (ODT) problem, we are given <em>m</em> hypotheses, out of which an unknown “true” hypothesis is drawn according to some probability distribution. The task is to identify the true hypothesis by performing costly queries, each with known responses. ODT is NP-hard to approximate within a factor of <span><math><mi>ln</mi><mo>⁡</mo><mi>m</mi></math></span>, and existing <span><math><mi>O</mi><mo>(</mo><mi>ln</mi><mo>⁡</mo><mi>m</mi><mo>)</mo></math></span> approximation algorithms are complex with large leading constants. We provide a simple algorithm and analysis for ODT, proving an approximation ratio of <span><math><mn>8</mn><mi>ln</mi><mo>⁡</mo><mi>m</mi></math></span>.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"64 ","pages":"Article 107370"},"PeriodicalIF":0.9,"publicationDate":"2025-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145159659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Some new ordering results on residual life and inactivity time of series systems with two components having statistically dependent lifetimes 具有统计相关寿命的两分量串联系统的剩余寿命和不活动时间的一些新的排序结果
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-09-17 DOI: 10.1016/j.orl.2025.107369
Rui Fang , Xiaohu Li
{"title":"Some new ordering results on residual life and inactivity time of series systems with two components having statistically dependent lifetimes","authors":"Rui Fang ,&nbsp;Xiaohu Li","doi":"10.1016/j.orl.2025.107369","DOIUrl":"10.1016/j.orl.2025.107369","url":null,"abstract":"<div><div>This study considers two components with statistically dependent lifetimes, and compares the residual lifetime of the series system of them and the lifetime of the series of used components with residual lifetimes. Sufficient and necessary conditions about the usual stochastic order and hazard rate order are developed. The findings reveal that the dependence structure is critical in determining whether the used system is more reliable. The inactivity time is also investigated. Numerical examples are also presented to illustrate the findings.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107369"},"PeriodicalIF":0.9,"publicationDate":"2025-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145105038","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A heuristic algorithm for aircraft conflict resolution based on closed-form analytical solutions of relaxed pairwise problems 基于松弛两两问题闭型解析解的飞机冲突求解启发式算法
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-09-16 DOI: 10.1016/j.orl.2025.107368
Fernando H.C. Dias , Hassan L. Hijazi , David Rey
{"title":"A heuristic algorithm for aircraft conflict resolution based on closed-form analytical solutions of relaxed pairwise problems","authors":"Fernando H.C. Dias ,&nbsp;Hassan L. Hijazi ,&nbsp;David Rey","doi":"10.1016/j.orl.2025.107368","DOIUrl":"10.1016/j.orl.2025.107368","url":null,"abstract":"<div><div>Given a set of aircraft, the objective of the aircraft conflict resolution problem is to determine least-deviating conflict-free trajectories. Efficient algorithms for conflict resolution problems are fundamental for automation in air traffic control. We develop a fast heuristic based on the closed-form analytical solutions of convex, bound-relaxed, two-aircraft problems. We leverage this knowledge to constructs feasible and efficient solutions to multi-aircraft problems. Computational benchmarking reveals that the proposed approach is able to find near-optimal solutions in competitive time.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107368"},"PeriodicalIF":0.9,"publicationDate":"2025-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145104305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Monotone convergence of spreading processes on networks 网络上扩展过程的单调收敛性
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-09-15 DOI: 10.1016/j.orl.2025.107363
Gadi Fibich, Amit Golan, Steven Schochet
{"title":"Monotone convergence of spreading processes on networks","authors":"Gadi Fibich,&nbsp;Amit Golan,&nbsp;Steven Schochet","doi":"10.1016/j.orl.2025.107363","DOIUrl":"10.1016/j.orl.2025.107363","url":null,"abstract":"<div><div>We analyze the Bass and SI models for the spreading of innovations and epidemics, respectively, on homogeneous complete networks, on one-dimensional networks, and on heterogeneous two-groups complete networks. We allow the network parameters to be time dependent, which is a prerequisite for the analysis of optimal promotional strategies on networks. Using a novel top-down analysis of the master equations, we present a simple proof for the monotone convergence of these models to their respective infinite-population limits. This leads to explicit expressions for the expected adoption or infection level in the Bass and SI models with time-dependent parameters on infinite homogeneous complete and circular networks, and on heterogeneous two-groups complete networks.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"64 ","pages":"Article 107363"},"PeriodicalIF":0.9,"publicationDate":"2025-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145098697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A branch-&-price approach to the unrooted maximum agreement forest problem 无根最大一致林问题的分支-价格方法
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-09-11 DOI: 10.1016/j.orl.2025.107364
Martin Frohn, Steven Kelk, Simona Vychytilova
{"title":"A branch-&-price approach to the unrooted maximum agreement forest problem","authors":"Martin Frohn,&nbsp;Steven Kelk,&nbsp;Simona Vychytilova","doi":"10.1016/j.orl.2025.107364","DOIUrl":"10.1016/j.orl.2025.107364","url":null,"abstract":"<div><div>We propose the first branch-&amp;-price algorithm for the maximum agreement forest problem on unrooted binary trees: given two unrooted <em>X</em>-labelled binary trees we seek to partition <em>X</em> into a minimum number of blocks such that the induced subtrees are disjoint and have the same topologies in both trees. We provide a dynamic programming algorithm for the weighted maximum agreement subtree problem to solve the pricing problem. When combined with rigorous polynomial-time pre-processing our branch-&amp;-price algorithm exhibits (beyond) state-of-the-art performance.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107364"},"PeriodicalIF":0.9,"publicationDate":"2025-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145048429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Strategic behavior of risk-averse agents under stochastic market clearing 市场随机出清下风险规避主体的策略行为
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-09-11 DOI: 10.1016/j.orl.2025.107365
Vincent Leclère , Andy Philpott
{"title":"Strategic behavior of risk-averse agents under stochastic market clearing","authors":"Vincent Leclère ,&nbsp;Andy Philpott","doi":"10.1016/j.orl.2025.107365","DOIUrl":"10.1016/j.orl.2025.107365","url":null,"abstract":"<div><div>We present a model of a commodity auction in which sellers and buyers (agents) represent risk using coherent risk measures. These are communicated to the auctioneer who computes socially optimal transactions assuming complete risk trading. The model is applied to economic dispatch and system marginal prices in a single-settlement wholesale electricity pool under uncertainty. If agents' risk measures are known by the system operator then prices form a socially optimal dispatch which is revenue adequate and recovers agents' costs in risk-adjusted expectation. We construct a non-cooperative game to show that agents have incentives to misrepresent their risk measures to improve their risk-adjusted profit.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107365"},"PeriodicalIF":0.9,"publicationDate":"2025-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145104306","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Subgame perfect Nash equilibrium analysis in a two-population strategic matching queue with nonzero matching times 非零匹配时间下两种群策略匹配队列的子博弈完美纳什均衡分析
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-09-11 DOI: 10.1016/j.orl.2025.107362
Hung Q. Nguyen , Tuan Phung-Duc
{"title":"Subgame perfect Nash equilibrium analysis in a two-population strategic matching queue with nonzero matching times","authors":"Hung Q. Nguyen ,&nbsp;Tuan Phung-Duc","doi":"10.1016/j.orl.2025.107362","DOIUrl":"10.1016/j.orl.2025.107362","url":null,"abstract":"<div><div>We study a two-population strategic queueing game in a double-ended system with nonzero matching times, where agents choose to join or balk. The resulting multi-dimensional state complicates analysis, but it can be shown that one dimension can be omitted in subgame perfect Nash equilibrium. The equilibrium strategies are threshold-based. Numerical results show that targeting one side with optimal pricing can improve social welfare, offering insights for system design.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107362"},"PeriodicalIF":0.9,"publicationDate":"2025-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145060550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the convergence of conditional gradient method for unbounded multiobjective optimization problems 无界多目标优化问题的条件梯度法的收敛性
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-09-11 DOI: 10.1016/j.orl.2025.107366
Wang Chen , Yong Zhao , Liping Tang , Xinmin Yang
{"title":"On the convergence of conditional gradient method for unbounded multiobjective optimization problems","authors":"Wang Chen ,&nbsp;Yong Zhao ,&nbsp;Liping Tang ,&nbsp;Xinmin Yang","doi":"10.1016/j.orl.2025.107366","DOIUrl":"10.1016/j.orl.2025.107366","url":null,"abstract":"<div><div>This paper focuses on developing the conditional gradient algorithm with adaptive step size for multiobjective optimization problems on unbounded feasible regions. By employing the recession cone, we establish the well-defined nature of the algorithm. Under mild assumptions, we obtain the asymptotic convergence property and the iteration-complexity bound. Furthermore, a new variant of the algorithm is proposed, and the rate of convergence of this variant is obtained. Numerical experiments are conducted to verify the performance of the algorithms.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107366"},"PeriodicalIF":0.9,"publicationDate":"2025-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145048431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Intellectual property protection and platform digitalization empowering technology entrepreneurship in emerging markets 知识产权保护和平台数字化助力新兴市场科技创业
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-09-09 DOI: 10.1016/j.orl.2025.107367
Wenhao Du , Qizhi He , Tengteng Cao , Junjun Wu
{"title":"Intellectual property protection and platform digitalization empowering technology entrepreneurship in emerging markets","authors":"Wenhao Du ,&nbsp;Qizhi He ,&nbsp;Tengteng Cao ,&nbsp;Junjun Wu","doi":"10.1016/j.orl.2025.107367","DOIUrl":"10.1016/j.orl.2025.107367","url":null,"abstract":"<div><div>We develop a supply chain model with endogenous interest rate to analyze the collaboration between digital business platforms and technology enterprises in emerging markets, focusing on how platform digital empowerment (PDE) and intellectual property protection (IPP) influence open innovation. We analyze static and dynamic equilibria under bank and platform financing strategies, explore the threshold effect of PDE and the nonlinear influence of IPP, and analyze profit variations among supply chain members under different channel power structures.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107367"},"PeriodicalIF":0.9,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145048430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"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学术文献互助群
群 号:604180095
Book学术官方微信