首页 > 最新文献

Operations Research Letters最新文献

英文 中文
Guessing a random function and repeated games in continuous time 猜测随机函数和连续时间中的重复博弈
IF 1.1 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-05-01 DOI: 10.1016/j.orl.2024.107120
Catherine Rainer , Eilon Solan

We study a game where one player selects a random function and the other guesses that function, and show that with high probability the second player can correctly guess most of the random function. We apply this analysis to continuous-time repeated games played with mixed strategies with delay, identify good responses of a player to any strategy profile of her opponents, and show that each player's minmax value coincides with her minmax value in pure strategies of the one-shot game.

我们研究了一名棋手选择随机函数、另一名棋手猜测该函数的博弈,结果表明第二名棋手很有可能正确猜测出大部分随机函数。我们将这一分析应用于采用延迟混合策略的连续时间重复博弈,确定了一个博弈者对其对手的任何策略特征的良好反应,并证明了每个博弈者的最小值与她在单次博弈的纯策略中的最小值相吻合。
{"title":"Guessing a random function and repeated games in continuous time","authors":"Catherine Rainer ,&nbsp;Eilon Solan","doi":"10.1016/j.orl.2024.107120","DOIUrl":"https://doi.org/10.1016/j.orl.2024.107120","url":null,"abstract":"<div><p>We study a game where one player selects a random function and the other guesses that function, and show that with high probability the second player can correctly guess most of the random function. We apply this analysis to continuous-time repeated games played with mixed strategies with delay, identify good responses of a player to any strategy profile of her opponents, and show that each player's minmax value coincides with her minmax value in pure strategies of the one-shot game.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"54 ","pages":"Article 107120"},"PeriodicalIF":1.1,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141072942","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
Reducing the Chvátal rank through binarization 通过二值化降低 Chvátal 等级
IF 1.1 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-05-01 DOI: 10.1016/j.orl.2024.107119
Gérard Cornuéjols, Vrishabh Patil

In a classical paper, Chvátal introduced a rounding procedure for strengthening the polyhedral relaxation P of an integer program; applied recursively, the number of iterations needed to obtain the convex hull of the integer solutions in P is known as the Chvátal rank. Chvátal showed that this rank can be exponential in the input size L needed to describe P. We give a compact extended formulation of P, described by introducing binary variables, whose rank is polynomial in L.

在一篇经典论文中,Chvátal 介绍了一种加强整数程序多面体松弛 P 的舍入过程;递归应用时,获得 P 中整数解凸壳所需的迭代次数称为 Chvátal 秩。我们给出了 P 的紧凑扩展表述,通过引入二进制变量进行描述,其秩为 L 的多项式。
{"title":"Reducing the Chvátal rank through binarization","authors":"Gérard Cornuéjols,&nbsp;Vrishabh Patil","doi":"10.1016/j.orl.2024.107119","DOIUrl":"10.1016/j.orl.2024.107119","url":null,"abstract":"<div><p>In a classical paper, Chvátal introduced a rounding procedure for strengthening the polyhedral relaxation <em>P</em> of an integer program; applied recursively, the number of iterations needed to obtain the convex hull of the integer solutions in <em>P</em> is known as the Chvátal rank. Chvátal showed that this rank can be exponential in the input size <em>L</em> needed to describe <em>P</em>. We give a compact extended formulation of <em>P</em>, described by introducing binary variables, whose rank is polynomial in <em>L</em>.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"54 ","pages":"Article 107119"},"PeriodicalIF":1.1,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167637724000555/pdfft?md5=31547e69830dd0795992e92a3c7a822a&pid=1-s2.0-S0167637724000555-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141052446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Some asymptotic properties of the Erlang-C formula in many-server limiting regimes Erlang-C 公式在多服务器极限状态下的一些渐近特性
IF 1.1 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-05-01 DOI: 10.1016/j.orl.2024.107116
Ragavendran Gopalakrishnan , Yueyang Zhong

This paper presents asymptotic properties of the Erlang-C formula in a spectrum of many-server limiting regimes. Specifically, we address an important gap in the literature regarding its limiting value in critically loaded regimes by studying extensions of the well-known square-root safety staffing rule used in the Quality-and-Efficiency-Driven (QED) regime.

本文介绍了 Erlang-C 公式在多服务器极限状态下的渐近特性。具体来说,我们通过研究质量和效率驱动(QED)机制中使用的著名平方根安全人员配置规则的扩展,解决了文献中有关其在临界负载机制中极限值的重要空白。
{"title":"Some asymptotic properties of the Erlang-C formula in many-server limiting regimes","authors":"Ragavendran Gopalakrishnan ,&nbsp;Yueyang Zhong","doi":"10.1016/j.orl.2024.107116","DOIUrl":"https://doi.org/10.1016/j.orl.2024.107116","url":null,"abstract":"<div><p>This paper presents asymptotic properties of the Erlang-C formula in a spectrum of many-server limiting regimes. Specifically, we address an important gap in the literature regarding its limiting value in critically loaded regimes by studying extensions of the well-known square-root safety staffing rule used in the Quality-and-Efficiency-Driven (QED) regime.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"54 ","pages":"Article 107116"},"PeriodicalIF":1.1,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S016763772400052X/pdfft?md5=4eebe7acf63a930d3a0551a1b0e70e7c&pid=1-s2.0-S016763772400052X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140948488","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization 非凸多目标优化中一大类下降算法的收敛性和复杂性保证
IF 1.1 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-04-22 DOI: 10.1016/j.orl.2024.107115
Matteo Lapucci

We address conditions for global convergence and worst-case complexity bounds of descent algorithms in nonconvex multi-objective optimization. Specifically, we define the concept of steepest-descent-related directions. We consider iterative algorithms taking steps along such directions, selecting the stepsize according to a standard Armijo-type rule. We prove that methods fitting this framework automatically enjoy global convergence properties. Moreover, we show that a slightly stricter property, satisfied by most known algorithms, guarantees the same complexity bound of O(ϵ2) as the steepest descent method.

我们探讨了非凸多目标优化中下降算法的全局收敛条件和最坏情况复杂度界限。具体来说,我们定义了最陡下降相关方向的概念。我们考虑沿着这些方向采取步骤的迭代算法,并根据标准的阿米约类型规则选择步长。我们证明,符合这一框架的方法自动享有全局收敛特性。此外,我们还证明,大多数已知算法都能满足的一个略微严格的属性,保证了与最陡降法相同的 O(ϵ-2) 复杂度约束。
{"title":"Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization","authors":"Matteo Lapucci","doi":"10.1016/j.orl.2024.107115","DOIUrl":"https://doi.org/10.1016/j.orl.2024.107115","url":null,"abstract":"<div><p>We address conditions for global convergence and worst-case complexity bounds of descent algorithms in nonconvex multi-objective optimization. Specifically, we define the concept of steepest-descent-related directions. We consider iterative algorithms taking steps along such directions, selecting the stepsize according to a standard Armijo-type rule. We prove that methods fitting this framework automatically enjoy global convergence properties. Moreover, we show that a slightly stricter property, satisfied by most known algorithms, guarantees the same complexity bound of <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>ϵ</mi></mrow><mrow><mo>−</mo><mn>2</mn></mrow></msup><mo>)</mo></math></span> as the steepest descent method.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"54 ","pages":"Article 107115"},"PeriodicalIF":1.1,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140643913","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
Dynamic capital allocation with reallocation cost 具有重新分配成本的动态资本分配
IF 1.1 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-04-12 DOI: 10.1016/j.orl.2024.107114
Ermo Chen, Lan Wu, Jingyi He

Traditional static capital allocation incurs significant reallocation costs over periods due to drastic fluctuations. We propose a new framework for dynamic capital allocation with time-varying capital constraints that incorporates reallocation costs. We obtain an analytical solution in a recursive form and demonstrate its admirable performance through simulations. The solution compromises between static allocation and expected future risk structure and strikes a balance between addressing current risk profiles and adjustment costs. It successfully provides an effective allocation tool while preserving stability.

传统的静态资本分配会因剧烈波动而在不同时期产生巨大的重新分配成本。我们提出了一个包含重新分配成本的、具有时变资本约束的动态资本分配新框架。我们得到了一个递归形式的分析解决方案,并通过仿真证明了其出色的性能。该解决方案在静态分配和预期未来风险结构之间做出了妥协,并在解决当前风险状况和调整成本之间取得了平衡。它在保持稳定性的同时,成功地提供了一种有效的分配工具。
{"title":"Dynamic capital allocation with reallocation cost","authors":"Ermo Chen,&nbsp;Lan Wu,&nbsp;Jingyi He","doi":"10.1016/j.orl.2024.107114","DOIUrl":"https://doi.org/10.1016/j.orl.2024.107114","url":null,"abstract":"<div><p>Traditional static capital allocation incurs significant reallocation costs over periods due to drastic fluctuations. We propose a new framework for dynamic capital allocation with time-varying capital constraints that incorporates reallocation costs. We obtain an analytical solution in a recursive form and demonstrate its admirable performance through simulations. The solution compromises between static allocation and expected future risk structure and strikes a balance between addressing current risk profiles and adjustment costs. It successfully provides an effective allocation tool while preserving stability.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"54 ","pages":"Article 107114"},"PeriodicalIF":1.1,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140555651","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
Partially observable discrete-time discounted Markov games with general utility 具有一般效用的部分可观测离散时间贴现马尔可夫博弈
IF 1.1 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-04-02 DOI: 10.1016/j.orl.2024.107113
Arnab Bhabak , Subhamay Saha

In this paper, we investigate partially observable zero sum games where the state process is a discrete time Markov chain. We consider a general utility function in the optimization criterion. We show the existence of value for both finite and infinite horizon games and also establish the existence of optimal polices. The main step involves converting the partially observable game into a completely observable game which also keeps track of the total discounted accumulated reward/cost.

在本文中,我们研究了状态过程为离散时间马尔可夫链的部分可观测零和博弈。我们在优化准则中考虑了一般效用函数。我们证明了有限地平线和无限地平线博弈的价值存在,并确定了最优政策的存在。主要步骤包括将部分可观测博弈转换为完全可观测博弈,该博弈还跟踪总贴现累计回报/成本。
{"title":"Partially observable discrete-time discounted Markov games with general utility","authors":"Arnab Bhabak ,&nbsp;Subhamay Saha","doi":"10.1016/j.orl.2024.107113","DOIUrl":"https://doi.org/10.1016/j.orl.2024.107113","url":null,"abstract":"<div><p>In this paper, we investigate partially observable zero sum games where the state process is a discrete time Markov chain. We consider a general utility function in the optimization criterion. We show the existence of value for both finite and infinite horizon games and also establish the existence of optimal polices. The main step involves converting the partially observable game into a completely observable game which also keeps track of the total discounted accumulated reward/cost.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"54 ","pages":"Article 107113"},"PeriodicalIF":1.1,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140350457","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
Maximal workload, minimal workload, maximal workload difference: Optimizing all criteria at once 最大工作量、最小工作量、最大工作量差异:同时优化所有标准
IF 1.1 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-03-28 DOI: 10.1016/j.orl.2024.107110
Sébastien Deschamps , Frédéric Meunier

In a simple model of assigning workers to tasks, every solution that minimizes the load difference between the most loaded worker and the least loaded one actually minimizes the maximal load and maximizes the minimal load. This can be seen as a consequence of standard results of optimization over polymatroids. We show that similar phenomena still occur in close models, simple to state, and that do not enjoy any polymatroid structure.

在一个将工人分配到任务的简单模型中,每一个能使工作量最大的工人与工作量最小的工人之间的工作量差最小化的方案,实际上都能使最大工作量最小化,而使最小工作量最大化。这可以看作是多面体优化的标准结果。我们的研究表明,类似的现象仍然会出现在状态简单、不具有多面体结构的近似模型中。
{"title":"Maximal workload, minimal workload, maximal workload difference: Optimizing all criteria at once","authors":"Sébastien Deschamps ,&nbsp;Frédéric Meunier","doi":"10.1016/j.orl.2024.107110","DOIUrl":"https://doi.org/10.1016/j.orl.2024.107110","url":null,"abstract":"<div><p>In a simple model of assigning workers to tasks, every solution that minimizes the load difference between the most loaded worker and the least loaded one actually minimizes the maximal load and maximizes the minimal load. This can be seen as a consequence of standard results of optimization over polymatroids. We show that similar phenomena still occur in close models, simple to state, and that do not enjoy any polymatroid structure.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"54 ","pages":"Article 107110"},"PeriodicalIF":1.1,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140341230","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
First passage time interdiction in Markov chains 马尔可夫链中的第一通过时间阻断
IF 1.1 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-03-27 DOI: 10.1016/j.orl.2024.107111
Niloufar Daemi, Juan S. Borrero, Balabhaskar Balasundaram

We introduce a new variant of the network interdiction problem with a Markovian evader that randomly chooses a neighboring vertex in each step to build their path from designated source(s) to terminal(s). The interdictor's goal is to maximize the evader's minimum expected first passage time. We establish sufficient conditions for the interdiction to not be counter-productive, prove that the problem is NP-hard, and demonstrate the model's usefulness by solving a mixed-integer programming formulation on a test bed of social networks.

我们引入了网络拦截问题的一个新变体,即马尔可夫逃逸者在每一步中随机选择一个邻近顶点,建立从指定源点到终点的路径。拦截者的目标是最大化逃避者的最小预期首次通过时间。我们建立了拦截不会产生反效果的充分条件,证明了该问题的 NP 难度,并通过在社交网络测试平台上求解混合整数编程公式证明了该模型的实用性。
{"title":"First passage time interdiction in Markov chains","authors":"Niloufar Daemi,&nbsp;Juan S. Borrero,&nbsp;Balabhaskar Balasundaram","doi":"10.1016/j.orl.2024.107111","DOIUrl":"https://doi.org/10.1016/j.orl.2024.107111","url":null,"abstract":"<div><p>We introduce a new variant of the network interdiction problem with a Markovian evader that randomly chooses a neighboring vertex in each step to build their path from designated source(s) to terminal(s). The interdictor's goal is to maximize the evader's minimum expected <em>first passage time</em>. We establish sufficient conditions for the interdiction to not be counter-productive, prove that the problem is NP-hard, and demonstrate the model's usefulness by solving a mixed-integer programming formulation on a test bed of social networks.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"54 ","pages":"Article 107111"},"PeriodicalIF":1.1,"publicationDate":"2024-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140350456","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 finiteness of the solution set of extended horizontal linear complementarity problem 论扩展水平线性互补问题解集的有限性
IF 1.1 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-03-27 DOI: 10.1016/j.orl.2024.107112
Punit Kumar Yadav, Palpandi Karuppaiah

In this paper, we introduce the concept of column nondegenerate-W property to the set of matrices, and we show that when the involved set of matrices have the column nondegenerate-W property is equivalent to the Extended Horizontal Linear Complementarity Problem have the finiteness property of the solution set.

本文将列非enerate-W性质的概念引入矩阵集合,并证明当所涉及的矩阵集合具有列非enerate-W性质时,等价于扩展水平线性互补问题的解集具有有限性性质。
{"title":"On finiteness of the solution set of extended horizontal linear complementarity problem","authors":"Punit Kumar Yadav,&nbsp;Palpandi Karuppaiah","doi":"10.1016/j.orl.2024.107112","DOIUrl":"10.1016/j.orl.2024.107112","url":null,"abstract":"<div><p>In this paper, we introduce the concept of column nondegenerate-<em>W</em> property to the set of matrices, and we show that when the involved set of matrices have the column nondegenerate-<em>W</em> property is equivalent to the Extended Horizontal Linear Complementarity Problem have the finiteness property of the solution set.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"54 ","pages":"Article 107112"},"PeriodicalIF":1.1,"publicationDate":"2024-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140403705","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
Cooperative equilibria of strategy-form games with both nontransferable and transferable utilities 具有不可转让和可转让效用的策略形式博弈的合作均衡点
IF 1.1 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-03-20 DOI: 10.1016/j.orl.2024.107109
Zhe Yang, Xinyu Yang

In this paper, we consider a class of strategy-form games with both nontransferable and transferable utilities. Inspired by NTU and TU α-core concepts, we first introduce the notion of cooperative equilibria, and prove the existence theorem in this model with finite dimensional strategy spaces. Furthermore, we extend the cooperative equilibrium existence theorem to strategy-form games with infinite dimensional strategy spaces.

在本文中,我们考虑了一类同时具有不可转让和可转让效用的策略形式博弈。受 NTU 和 TU α 核心概念的启发,我们首先引入了合作均衡的概念,并证明了该模型中有限维度策略空间的存在性定理。此外,我们还将合作均衡存在定理扩展到无限维策略空间的策略形式博弈。
{"title":"Cooperative equilibria of strategy-form games with both nontransferable and transferable utilities","authors":"Zhe Yang,&nbsp;Xinyu Yang","doi":"10.1016/j.orl.2024.107109","DOIUrl":"https://doi.org/10.1016/j.orl.2024.107109","url":null,"abstract":"<div><p>In this paper, we consider a class of strategy-form games with both nontransferable and transferable utilities. Inspired by NTU and TU <em>α</em>-core concepts, we first introduce the notion of cooperative equilibria, and prove the existence theorem in this model with finite dimensional strategy spaces. Furthermore, we extend the cooperative equilibrium existence theorem to strategy-form games with infinite dimensional strategy spaces.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"54 ","pages":"Article 107109"},"PeriodicalIF":1.1,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140209425","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
期刊
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学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1