首页 > 最新文献

Operations Research Letters最新文献

英文 中文
Energy-optimal scheduling with variable processing speed: The role of task size variability 变加工速度下的能量最优调度：任务大小可变性的作用
IF 0.9 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Operations Research Letters
Pub Date : 2025-10-01 DOI: 10.1016/j.orl.2025.107379
Jonatha Anselmi, Bruno Gaujal
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.
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.
在本文中，我们研究了一个未知大小的单一任务的执行在一个服务器上具有可变的处理速度。我们的目标是分析在满足硬截止日期约束的同时最小化预期能耗的最佳速度剖面下的最佳能耗结构特性。具体来说，我们研究了任务大小概率分布对总能量的影响。在温和的假设下，我们的主要结果表明，由最优速度曲线引起的期望能量消耗相对于任务大小分布保持凸递增顺序。然后，我们利用这个性质来推导简单的边界并进行最坏情况分析。特别地，我们推导了一个简单的，由“最佳”和“最差”任务大小分布引起的能量差距的通用公式，用任务大小的支持和期望来表示。
{"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区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Operations Research Letters
Pub Date : 2025-09-25 DOI: 10.1016/j.orl.2025.107370
Zhengjia Zhuo, Viswanath Nagarajan
In the optimal decision tree (ODT) problem, we are given m 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 ln⁡m, and existing O(ln⁡m) approximation algorithms are complex with large leading constants. We provide a simple algorithm and analysis for ODT, proving an approximation ratio of 8ln⁡m.
在最优决策树（ODT）问题中，我们给定m个假设，其中一个未知的“真”假设根据某种概率分布被绘制出来。任务是通过执行代价高昂的查询来识别真实的假设，每个查询都有已知的响应。ODT是np困难的，难以在ln (m)的因子内近似，而现有的O（ln (m)）近似算法由于前导常数较大而很复杂。我们提供了一个简单的ODT算法和分析，证明了近似比为8ln ln m。
{"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区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Operations Research Letters
Pub Date : 2025-09-17 DOI: 10.1016/j.orl.2025.107369
Rui Fang , Xiaohu Li
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.
本文考虑了两个具有统计依赖寿命的部件，并将它们串联系统的剩余寿命与具有剩余寿命的使用部件的系列寿命进行了比较。给出了一般随机序和危险率序的充要条件。研究结果表明，依赖结构是决定所使用系统是否更可靠的关键。研究了不活动时间。数值算例也说明了研究结果。
{"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区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Operations Research Letters
Pub Date : 2025-09-16 DOI: 10.1016/j.orl.2025.107368
Fernando H.C. Dias , Hassan L. Hijazi , David Rey
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.
给定一组飞机，飞机冲突解决问题的目标是确定偏离最小的无冲突轨迹。有效的冲突解决算法是实现空中交通管制自动化的基础。本文提出了一种基于凸、界松弛、双平面问题的闭型解析解的快速启发式算法。我们利用这些知识来构建可行和高效的解决方案，多飞机的问题。计算基准测试表明，所提出的方法能够在竞争时间内找到接近最优的解决方案。
{"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区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Operations Research Letters
Pub Date : 2025-09-15 DOI: 10.1016/j.orl.2025.107363
Gadi Fibich, Amit Golan, Steven Schochet
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.
我们分别在同质完全网络、一维网络和异质双群体完全网络上分析了创新和流行病传播的Bass和SI模型。我们允许网络参数是时间相关的，这是分析网络上最优促销策略的先决条件。利用一种新颖的自顶向下的主方程分析方法，我们给出了这些模型在各自的无穷种群极限下单调收敛的简单证明。这导致Bass和SI模型中具有时间依赖参数的无限齐次完全网络和圆形网络以及异构两组完全网络中预期采用或感染水平的显式表达式。
{"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区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Operations Research Letters
Pub Date : 2025-09-11 DOI: 10.1016/j.orl.2025.107364
Martin Frohn, Steven Kelk, Simona Vychytilova
We propose the first branch-&-price algorithm for the maximum agreement forest problem on unrooted binary trees: given two unrooted X-labelled binary trees we seek to partition X 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-&-price algorithm exhibits (beyond) state-of-the-art performance.
我们针对无根二叉树上的最大一致森林问题提出了第一个branch-&；-price算法：给定两棵无根X标记的二叉树，我们寻求将X划分为最小数量的块，使得诱导子树不相交，并且在两棵树中具有相同的拓扑结构。针对加权最大协议子树问题，提出了一种求解定价问题的动态规划算法。当与严格的多项式时间预处理相结合时，我们的分支价格算法表现出（超越）最先进的性能。
{"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区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Operations Research Letters
Pub Date : 2025-09-11 DOI: 10.1016/j.orl.2025.107365
Vincent Leclère , Andy Philpott
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.
我们提出了一个商品拍卖的模型，其中卖方和买方（代理人）使用一致的风险度量来表示风险。这些信息被传达给拍卖师，拍卖师在完全风险交易的情况下计算社会最优交易。将该模型应用于不确定条件下单结算批发电力池的经济调度和系统边际电价问题。如果系统运营商知道代理商的风险度量，则价格形成一个社会最优调度，该调度是收入充足的，并且在风险调整后的预期中恢复代理商的成本。我们构造了一个非合作博弈来证明代理人有动机歪曲他们的风险度量来提高他们的风险调整利润。
{"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区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Operations Research Letters
Pub Date : 2025-09-11 DOI: 10.1016/j.orl.2025.107362
Hung Q. Nguyen , Tuan Phung-Duc
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.
研究了具有非零匹配时间的双端系统中的两种群策略排队博弈，其中agent选择加入或不加入。由此产生的多维状态使分析变得复杂，但可以证明在子博弈完美纳什均衡中可以省略一个维度。均衡策略是基于阈值的。数值计算结果表明，以最优定价为目标的一方可以提高社会福利，为制度设计提供启示。
{"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区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Operations Research Letters
Pub Date : 2025-09-11 DOI: 10.1016/j.orl.2025.107366
Wang Chen , Yong Zhao , Liping Tang , Xinmin Yang
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.
研究了无界可行域上多目标优化问题的自适应步长条件梯度算法。通过使用衰退锥，我们建立了算法的良好定义性质。在温和的假设条件下，我们得到了该算法的渐近收敛性和迭代复杂度界。在此基础上，提出了该算法的一种新变体，并得到了该变体的收敛速度。通过数值实验验证了算法的性能。
{"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区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Operations Research Letters
Pub Date : 2025-09-09 DOI: 10.1016/j.orl.2025.107367
Wenhao Du , Qizhi He , Tengteng Cao , Junjun Wu
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.
本文建立了一个内生利率的供应链模型，分析了新兴市场中数字商业平台与科技企业之间的合作，重点研究了平台数字赋权（PDE）和知识产权保护（IPP）对开放式创新的影响。分析了银行和平台融资策略下的静态和动态均衡，探讨了PDE的阈值效应和IPP的非线性影响，并分析了不同渠道权力结构下供应链成员之间的利润变化。
{"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
首页 上一页 下一页 尾页
类型
全部 化学•材料 生命科学 医学 物理 工程技术 环境•农林 材料科学 地球科学 法学 管理学 化学 环境科学与生态学 计算机科学 教育学 经济学 农林科学 人文科学 生物学 数学 物理与天体物理 心理学 综合性期刊 其他 工业工程 理学 历史学 农学 文学 信息工程
数据库
全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley
期刊
Operations Research Letters
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们：info@booksci.cn
Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1