发布求助
文献互助 智能选刊 最新文献

Operations Research Letters最新文献

筛选
英文 中文
A linear programming-based hyper local search for tuning hyperparameters 基于线性规划的超局部寻优超参数
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-04-02 DOI: 10.1016/j.orl.2025.107287
Ankur Sinha , Satender Gunwal
{"title":"A linear programming-based hyper local search for tuning hyperparameters","authors":"Ankur Sinha ,&nbsp;Satender Gunwal","doi":"10.1016/j.orl.2025.107287","DOIUrl":"10.1016/j.orl.2025.107287","url":null,"abstract":"<div><div>We introduce a linear programming-based approach for hyperparameter tuning of machine learning models. The approach finetunes continuous hyperparameters and model parameters through a linear program, enhancing model generalization in the vicinity of an initial model. The proposed method converts hyperparameter optimization into a bilevel program and identifies a descent direction to improve validation loss. The results demonstrate improvements in most cases across regression, machine learning, and deep learning tasks, with test performance enhancements ranging from 0.3% to 28.1%.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107287"},"PeriodicalIF":0.8,"publicationDate":"2025-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143768457","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
Optimal procurement under backwardation and the benefits of the manifestation of demand aggregators 现货溢价条件下的最优采购及需求聚合效应的体现
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-04-01 DOI: 10.1016/j.orl.2025.107286
Ioannis Avramopoulos, Prodromos Makris, Emmanouel Varvarigos
{"title":"Optimal procurement under backwardation and the benefits of the manifestation of demand aggregators","authors":"Ioannis Avramopoulos,&nbsp;Prodromos Makris,&nbsp;Emmanouel Varvarigos","doi":"10.1016/j.orl.2025.107286","DOIUrl":"10.1016/j.orl.2025.107286","url":null,"abstract":"<div><div>Normal backwardation manifests when the futures price of a commodity is below the expected future spot price. In this paper, we show how businesses can optimally leverage backwardation in their supply chain optimization. To that end, we derive the optimal amount a business ought to purchase in the futures market to take advantage of the favorable futures price in order to minimize the overall expected procurement cost. We further use Hoeffding's inequality to predict the manifestation of demand aggregators.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107286"},"PeriodicalIF":0.8,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143747590","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
Finding a good normal population 找到一个良好的正常人口
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-03-31 DOI: 10.1016/j.orl.2025.107281
Sheldon M. Ross, Tianchi Zhao
{"title":"Finding a good normal population","authors":"Sheldon M. Ross,&nbsp;Tianchi Zhao","doi":"10.1016/j.orl.2025.107281","DOIUrl":"10.1016/j.orl.2025.107281","url":null,"abstract":"<div><div>We study the problem of finding a normal population whose mean is at least as large as some specified value <em>m</em>. Assuming a sampling cost, the objective is to minimize the expected total discounted cost until there is a population whose mean is at least <em>m</em> with probability at least <em>α</em>. We propose several heuristic policies as well as a linear programming approach.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107281"},"PeriodicalIF":0.8,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143737992","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 queens and tours 关于女王和旅行团
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-03-28 DOI: 10.1016/j.orl.2025.107283
Pieter Jacobs, Andrés López Martínez, Frits Spieksma
{"title":"On queens and tours","authors":"Pieter Jacobs,&nbsp;Andrés López Martínez,&nbsp;Frits Spieksma","doi":"10.1016/j.orl.2025.107283","DOIUrl":"10.1016/j.orl.2025.107283","url":null,"abstract":"<div><div>Given the complete graph on <em>n</em> vertices, where <span><math><mi>n</mi><mo>≥</mo><mn>3</mn></math></span>, we define two Hamiltonian cycles as <em>cyclic disjoint</em> if, for each pair of vertices, the distance between them in one Hamiltonian cycle differs from the distance between them in the other Hamiltonian cycle. We investigate the number of pairwise cyclic disjoint tours that exist in <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. Specifically, we identify when pairs of cyclic disjoint tours can occur and provide a procedure to generate <span><math><mfrac><mrow><mi>m</mi><mo>−</mo><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></math></span> pairwise cyclic disjoint tours, where <em>m</em> is the smallest prime factor of <em>n</em>. Finally, we demonstrate that the number <span><math><mfrac><mrow><mi>m</mi><mo>−</mo><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></math></span> of pairwise cyclic disjoint tours is maximized when <em>n</em> is prime.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107283"},"PeriodicalIF":0.8,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143737991","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
q-fixed majority efficiency of committee scoring rules q-固定多数效率的委员会评分规则
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-03-28 DOI: 10.1016/j.orl.2025.107282
Clinton Gubong Gassi , Eric Kamwa
{"title":"q-fixed majority efficiency of committee scoring rules","authors":"Clinton Gubong Gassi ,&nbsp;Eric Kamwa","doi":"10.1016/j.orl.2025.107282","DOIUrl":"10.1016/j.orl.2025.107282","url":null,"abstract":"<div><div>This paper introduces the <em>q</em>-fixed majority property for committee selection rules, which extends the traditional fixed majority principle to a flexible framework. We examine conditions under which the committee scoring rules satisfy the <em>q</em>-fixed majority property. Focusing on (weakly) separable rules, we find that the Bloc rule is the only which satisfies it for all <span><math><mi>q</mi><mo>&gt;</mo><mn>1</mn><mo>/</mo><mn>2</mn></math></span>. In addition, the <em>q</em>-bottom majority property is introduced, highlighting conditions under which committees can be excluded based on voter consensus.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107282"},"PeriodicalIF":0.8,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143737990","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
Universally optimal staffing for Erlang-A queues facing uncertain arrival rates: The case of constraint satisfaction 面对不确定到达率的Erlang-A队列的普遍最优人员配置：约束满足的情况
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-03-20 DOI: 10.1016/j.orl.2025.107279
Yaşar Levent Koçağa
{"title":"Universally optimal staffing for Erlang-A queues facing uncertain arrival rates: The case of constraint satisfaction","authors":"Yaşar Levent Koçağa","doi":"10.1016/j.orl.2025.107279","DOIUrl":"10.1016/j.orl.2025.107279","url":null,"abstract":"<div><div>Motivated by service systems where staffing decisions must be made before the arrival rate becomes known, we study the <em>constraint satisfaction</em> problem in an Erlang-A queue facing a <em>random</em> arrival rate. The objective is to find the minimum staffing level subject to a service level constraint that is modeled either (1) via an <em>average constraint</em> formulation that ensures a given quality-of-service (QoS) target holds on average by bounding the <em>average</em> fraction of abandoning customers below the said QoS target or (2) via a <em>chance constraint</em> formulation that ensures the QoS target for the random fraction of abandoning customers is met with high <em>probability</em>. Our primary contribution, under each constraint formulation, is to propose a policy that is shown to be universally optimal, i.e., <em>irrespective</em> of the magnitude of randomness in the arrival rate, the staffing gap between the proposed policy and the exact optimal policy remains bounded as the system size grows large. To the best of our knowledge, this is the first universal performance guarantee for constraint satisfaction in Erlang-A queues with random arrival rates and complements a recent result on cost minimization. The practical importance of this universality is that our proposed policy is a “one-size-fits-all” that is guaranteed to perform well for <em>all</em> levels of arrival rate uncertainty.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"60 ","pages":"Article 107279"},"PeriodicalIF":0.8,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143687571","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
Transient analysis of a renewal input multiserver queueing model with infinite buffer 具有无限缓冲区的更新输入多服务器队列模型的瞬态分析
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-03-20 DOI: 10.1016/j.orl.2025.107275
Ashwini Soundararajan, F.P. Barbhuiya
{"title":"Transient analysis of a renewal input multiserver queueing model with infinite buffer","authors":"Ashwini Soundararajan,&nbsp;F.P. Barbhuiya","doi":"10.1016/j.orl.2025.107275","DOIUrl":"10.1016/j.orl.2025.107275","url":null,"abstract":"<div><div>This paper presents a time-dependent solution for the system-content distribution of the infinite buffer <span><math><mi>G</mi><mi>I</mi><mo>/</mo><mi>M</mi><mo>/</mo><mi>c</mi></math></span> queue. The supplementary variable and the difference equation technique is used to obtain the probabilities in terms of Laplace transform. Some relevant performance measures are derived and extensive numerical results are presented. It covers a comparison of the impact of heavy-tailed and light-tailed interarrival time distributions on the transient behavior of the system and the underlying system characteristics.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"60 ","pages":"Article 107275"},"PeriodicalIF":0.8,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143687570","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
Exact simulation scheme for the Ornstein–Uhlenbeck driven stochastic volatility model with the Karhunen–Loève expansions Ornstein-Uhlenbeck驱动的karhunen - lo<e:1>洛夫展开式随机波动模型的精确模拟方案
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-03-18 DOI: 10.1016/j.orl.2025.107280
Jaehyuk Choi
{"title":"Exact simulation scheme for the Ornstein–Uhlenbeck driven stochastic volatility model with the Karhunen–Loève expansions","authors":"Jaehyuk Choi","doi":"10.1016/j.orl.2025.107280","DOIUrl":"10.1016/j.orl.2025.107280","url":null,"abstract":"<div><div>This study proposes a fast exact simulation scheme for the Ornstein–Uhlenbeck driven stochastic volatility model. With the Karhunen–Loève expansions, the stochastic volatility path (Ornstein–Uhlenbeck process) is expressed as a sine series, and the time integrals of volatility and variance are analytically derived as infinite series of independent normal random variables. The new method is several hundred times faster than the existing method using numerical transform inversion. The simulation variance is further reduced with conditional simulation and the control variate.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"60 ","pages":"Article 107280"},"PeriodicalIF":0.8,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143696750","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
Time-dependent Stackelberg protection location games 时间依赖的Stackelberg保护位置游戏
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-03-13 DOI: 10.1016/j.orl.2025.107278
Lotte van Aken, Loe Schlicher , Marco Slikker
{"title":"Time-dependent Stackelberg protection location games","authors":"Lotte van Aken,&nbsp;Loe Schlicher ,&nbsp;Marco Slikker","doi":"10.1016/j.orl.2025.107278","DOIUrl":"10.1016/j.orl.2025.107278","url":null,"abstract":"<div><div>We study a Stackelberg game in which a government positions rapid response teams and thereafter a terrorist attacks a location on a line segment. We assume the damage associated to such an attack to be time dependent. We show that there exists a subgame perfect Nash equilibrium that balances the possible damage on all intervals of the line segment that result from positioning the rapid response teams. We discuss implications for an instance of the model.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"60 ","pages":"Article 107278"},"PeriodicalIF":0.8,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143703946","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
Positivity of incomplete cooperative games revisited 重新审视不完全合作博弈的积极性
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-03-12 DOI: 10.1016/j.orl.2025.107277
Martin Černý
{"title":"Positivity of incomplete cooperative games revisited","authors":"Martin Černý","doi":"10.1016/j.orl.2025.107277","DOIUrl":"10.1016/j.orl.2025.107277","url":null,"abstract":"<div><div>We consider incomplete cooperative games, where only some coalitions' values are specified and others remain indeterminate. Focusing on <em>positive extensions</em>—fully defined cooperative games that agree with the partial data and have nonnegative dividends—we introduce a novel, two-stage dividend-assignment procedure that fully characterizes all such extensions. Our method offers a general criterion for positivity-extendability, introduces an explicit lower bound game, and provides an understanding of the structure of extreme points in the extension set. These contributions significantly expand the toolkit for theoretical analyses and practical computations of incomplete cooperative games, and also shed new light on properties of classical cooperative games.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"60 ","pages":"Article 107277"},"PeriodicalIF":0.8,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143609251","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学术文献互助群
群 号：481959085
Book学术官方微信