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

Operations Research Letters最新文献

筛选
英文 中文
Resource-robust valid inequalities for vehicle routing and related problems 车辆路径及相关问题的资源鲁棒有效不等式
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-08-14 DOI: 10.1016/j.orl.2025.107355
Ymro N. Hoogendoorn , Kevin Dalmeijer
{"title":"Resource-robust valid inequalities for vehicle routing and related problems","authors":"Ymro N. Hoogendoorn ,&nbsp;Kevin Dalmeijer","doi":"10.1016/j.orl.2025.107355","DOIUrl":"10.1016/j.orl.2025.107355","url":null,"abstract":"<div><div>Branch-price-and-cut algorithms play an important role in solving many vehicle routing problems (VRPs). Adding valid inequalities in this framework can impact the pricing subproblem, for which the literature distinguishes between ‘robust’ and ‘non-robust’ cuts. We define the ‘robust application’ of a cut in a specific context, making this distinction more precise. Next, we define broader ‘resource-robust applications’ that can be handled efficiently in the subproblem. We then introduce new resource-robust valid inequalities and show computational benefits for the capacitated VRP.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107355"},"PeriodicalIF":0.9,"publicationDate":"2025-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144860322","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
Disconnectedness Brings Robustness? On Network Design For Matching With Vertex Interdiction 断开连接带来健壮性？顶点截断匹配的网络设计
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-08-08 DOI: 10.1016/j.orl.2025.107352
Eugene T.Y. Ang , Yifan Feng
{"title":"Disconnectedness Brings Robustness? On Network Design For Matching With Vertex Interdiction","authors":"Eugene T.Y. Ang ,&nbsp;Yifan Feng","doi":"10.1016/j.orl.2025.107352","DOIUrl":"10.1016/j.orl.2025.107352","url":null,"abstract":"<div><div>This paper investigates sparse network designs that support large matchings under adversarial vertex deletions. We find that while connected structures (e.g., <em>chain-type</em> graphs) can be optimal when sparsity constraints are less stringent, disconnected structures (e.g., <em>cluster-type</em> graphs) can be optimal otherwise. We characterize the performance of chains and clusters to understand how the preferred design transitions from the former to the latter. Our analysis suggests that clusters are more robust to disruption, making them more advantageous in high-stress environments.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107352"},"PeriodicalIF":0.9,"publicationDate":"2025-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144826446","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
Single-machine makespan scheduling with scenario-dependent release dates 具有场景相关发布日期的单机最大完成时间调度
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-08-06 DOI: 10.1016/j.orl.2025.107353
Zhichao Geng, Yuan Gao
{"title":"Single-machine makespan scheduling with scenario-dependent release dates","authors":"Zhichao Geng,&nbsp;Yuan Gao","doi":"10.1016/j.orl.2025.107353","DOIUrl":"10.1016/j.orl.2025.107353","url":null,"abstract":"<div><div>This paper addresses the robust single-machine makespan scheduling problems, in which the processing times of jobs and a set of discrete scenarios are given, and the release dates of jobs are scenario-dependent. For three common criteria (absolute robustness, maximum regret and relative maximum regret) relevant to robust optimization approaches, we show that the corresponding problems are all polynomially solvable.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107353"},"PeriodicalIF":0.9,"publicationDate":"2025-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144829644","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 solving approach to moment problems with nonnegative Chebyshev ambiguity sets 非负Chebyshev模糊集矩问题的精确求解方法
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-07-30 DOI: 10.1016/j.orl.2025.107349
Jiayi Guo , Hao Qiu , Zhen Wang , Zizhuo Wang , Xinxin Zhang
{"title":"Exact solving approach to moment problems with nonnegative Chebyshev ambiguity sets","authors":"Jiayi Guo ,&nbsp;Hao Qiu ,&nbsp;Zhen Wang ,&nbsp;Zizhuo Wang ,&nbsp;Xinxin Zhang","doi":"10.1016/j.orl.2025.107349","DOIUrl":"10.1016/j.orl.2025.107349","url":null,"abstract":"<div><div>We study the moment problem with nonnegative Chebyshev ambiguity set (MPNC), which is foundational to distributionally robust optimization (DRO) and has applications in inventory, pricing, and portfolio selection problems. While univariate MPNC is well-studied, bivariate/multivariate MPNC lacks analytical solutions. We characterize bivariate MPNC's optimal support for piecewise-linear objectives, propose an exact numerical method, and derive closed-form solutions for two instances. We apply our result to a DRO newsvendor problem and derive interesting managerial insights.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107349"},"PeriodicalIF":0.9,"publicationDate":"2025-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144749731","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
The price of EF1 for few agents with additive ternary valuations 具有加法三元估值的少数代理商的EF1的价格
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-07-30 DOI: 10.1016/j.orl.2025.107351
Maria Kyropoulou, Alexandros A. Voudouris
{"title":"The price of EF1 for few agents with additive ternary valuations","authors":"Maria Kyropoulou,&nbsp;Alexandros A. Voudouris","doi":"10.1016/j.orl.2025.107351","DOIUrl":"10.1016/j.orl.2025.107351","url":null,"abstract":"<div><div>We consider a resource allocation problem with agents that have additive ternary valuations for a set of indivisible items, and bound the price of envy-free up to one item (EF1) allocations. For a large number <em>n</em> of agents, we show a lower bound of <span><math><mi>Ω</mi><mo>(</mo><msqrt><mrow><mi>n</mi></mrow></msqrt><mo>)</mo></math></span>, implying that the price of EF1 is no better than when the agents have general subadditive valuations. We then focus on instances with few agents and show that the price of EF1 is 12/11 for <span><math><mi>n</mi><mo>=</mo><mn>2</mn></math></span>, and between 1.2 and 1.256 for <span><math><mi>n</mi><mo>=</mo><mn>3</mn></math></span>.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107351"},"PeriodicalIF":0.9,"publicationDate":"2025-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144725040","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
Improved bounds on the probability of a union and on the number of events that occur 改进了联合概率和发生事件数的边界
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-07-29 DOI: 10.1016/j.orl.2025.107350
Ilan Adler , Richard M. Karp , Sheldon M. Ross
{"title":"Improved bounds on the probability of a union and on the number of events that occur","authors":"Ilan Adler ,&nbsp;Richard M. Karp ,&nbsp;Sheldon M. Ross","doi":"10.1016/j.orl.2025.107350","DOIUrl":"10.1016/j.orl.2025.107350","url":null,"abstract":"<div><div>Let <span><math><msub><mrow><mi>A</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>A</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> be events in a sample space. Given the probability of the intersection of each collection of up to <span><math><mi>k</mi><mo>+</mo><mn>1</mn></math></span> of these events, what can we say about the probability that at least <em>r</em> of the events occur? This question dates back to Boole in the 19th century, and it is well known that the odd partial sums of the Inclusion-Exclusion formula provide upper bounds, while the even partial sums provide lower bounds. We give a combinatorial characterization of the error in these bounds and use it to derive a very simple proof of the strongest possible bounds of a certain form, as well as a couple of improved bounds. The new bounds use more information than the classical Bonferroni-type inequalities, and are often sharper.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107350"},"PeriodicalIF":0.9,"publicationDate":"2025-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144749730","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 general framework for sequential batch-testing 顺序批量测试的通用框架
IF 0.9 4区 管理学
Operations Research Letters Pub Date : 2025-07-29 DOI: 10.1016/j.orl.2025.107348
Rayen Tan , Alex Xu , Viswanath Nagarajan
{"title":"A general framework for sequential batch-testing","authors":"Rayen Tan ,&nbsp;Alex Xu ,&nbsp;Viswanath Nagarajan","doi":"10.1016/j.orl.2025.107348","DOIUrl":"10.1016/j.orl.2025.107348","url":null,"abstract":"<div><div>We provide a generic method that transforms a non-adaptive solution for classic sequential testing problems into a solution for the more general batched setting, while incurring only an additive <span><math><mfrac><mrow><mn>1</mn></mrow><mrow><msqrt><mrow><mn>2</mn></mrow></msqrt></mrow></mfrac></math></span> fraction loss in the approximation ratio. Combined with previously-known approximation algorithms in the classic setting, we obtain batched algorithms for AND, <em>k</em>-of-<em>n</em> and score-classification functions with approximation ratios 1.707, 2.618 and 6.371 respectively. Our algorithm is very efficient, running in <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span> time for all the aforementioned functions.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107348"},"PeriodicalIF":0.9,"publicationDate":"2025-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144770985","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
VIX options in the SABR model SABR模型中的VIX期权
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-07-24 DOI: 10.1016/j.orl.2025.107347
Dan Pirjol , Lingjiong Zhu
{"title":"VIX options in the SABR model","authors":"Dan Pirjol ,&nbsp;Lingjiong Zhu","doi":"10.1016/j.orl.2025.107347","DOIUrl":"10.1016/j.orl.2025.107347","url":null,"abstract":"<div><div>We study the pricing of VIX options in the SABR model <span><math><mi>d</mi><msub><mrow><mi>S</mi></mrow><mrow><mi>t</mi></mrow></msub><mo>=</mo><msub><mrow><mi>σ</mi></mrow><mrow><mi>t</mi></mrow></msub><msubsup><mrow><mi>S</mi></mrow><mrow><mi>t</mi></mrow><mrow><mi>β</mi></mrow></msubsup><mi>d</mi><msub><mrow><mi>B</mi></mrow><mrow><mi>t</mi></mrow></msub><mo>,</mo><mi>d</mi><msub><mrow><mi>σ</mi></mrow><mrow><mi>t</mi></mrow></msub><mo>=</mo><mi>ω</mi><msub><mrow><mi>σ</mi></mrow><mrow><mi>t</mi></mrow></msub><mi>d</mi><msub><mrow><mi>Z</mi></mrow><mrow><mi>t</mi></mrow></msub></math></span> where <span><math><msub><mrow><mi>B</mi></mrow><mrow><mi>t</mi></mrow></msub><mo>,</mo><msub><mrow><mi>Z</mi></mrow><mrow><mi>t</mi></mrow></msub></math></span> are standard Brownian motions correlated with correlation <span><math><mi>ρ</mi><mo>&lt;</mo><mn>0</mn></math></span> and <span><math><mn>0</mn><mo>≤</mo><mi>β</mi><mo>&lt;</mo><mn>1</mn></math></span>. VIX is expressed as a risk-neutral conditional expectation of an integral over the volatility process <span><math><msub><mrow><mi>v</mi></mrow><mrow><mi>t</mi></mrow></msub><mo>=</mo><msubsup><mrow><mi>S</mi></mrow><mrow><mi>t</mi></mrow><mrow><mi>β</mi><mo>−</mo><mn>1</mn></mrow></msubsup><msub><mrow><mi>σ</mi></mrow><mrow><mi>t</mi></mrow></msub></math></span>. We show that <span><math><msub><mrow><mi>v</mi></mrow><mrow><mi>t</mi></mrow></msub></math></span> is the unique solution to a one-dimensional diffusion process. Using the Feller test, we show that <span><math><msub><mrow><mi>v</mi></mrow><mrow><mi>t</mi></mrow></msub></math></span> explodes in finite time with non-zero probability. As a consequence, VIX futures and VIX call prices are infinite, and VIX put prices are zero for any maturity. As a remedy, we propose a capped volatility process by capping the drift and diffusion terms in the <span><math><msub><mrow><mi>v</mi></mrow><mrow><mi>t</mi></mrow></msub></math></span> process such that it becomes non-explosive and well-behaved, and study the short-maturity asymptotics for the pricing of VIX options.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107347"},"PeriodicalIF":0.8,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144713678","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 note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses 关于Ratliff和Rosenthal的矩形仓库拣货算法的一个过渡说明
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-06-27 DOI: 10.1016/j.orl.2025.107325
Paul Revenant , Hadrien Cambazard , Nicolas Catusse
{"title":"A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses","authors":"Paul Revenant ,&nbsp;Hadrien Cambazard ,&nbsp;Nicolas Catusse","doi":"10.1016/j.orl.2025.107325","DOIUrl":"10.1016/j.orl.2025.107325","url":null,"abstract":"<div><div>The order picking problem involves determining the shortest tour for a picker to collect a set of products in a warehouse. Ratliff and Rosenthal introduced a linear algorithm to solve this problem for warehouses with two cross aisles, allowing for tours that double-cross entire aisles. In this paper, we prove that in rectangular warehouses, a minimum-length tour always exists that avoids double-crossing any aisle. This result simplifies the problem by eliminating redundant configurations.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"62 ","pages":"Article 107325"},"PeriodicalIF":0.8,"publicationDate":"2025-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144491979","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
Approximate mixed type duality for semi-infinite programs having equilibrium constraints 具有平衡约束的半无限规划的近似混合对偶性
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-06-18 DOI: 10.1016/j.orl.2025.107324
Tamanna Yadav, S.K. Gupta, Bishal Biswas
{"title":"Approximate mixed type duality for semi-infinite programs having equilibrium constraints","authors":"Tamanna Yadav,&nbsp;S.K. Gupta,&nbsp;Bishal Biswas","doi":"10.1016/j.orl.2025.107324","DOIUrl":"10.1016/j.orl.2025.107324","url":null,"abstract":"<div><div>This research delves into the study of a multiobjective non-smooth semi-infinite programming problem with equilibrium constraints. Utilizes the locally Lipschitz property of functions, we develop an approximate sufficient optimality result for the semi-infinite program using the approximate <em>M</em>-stationary point. Additionally, we construct an approximate mixed-type dual problem for the considered semi-infinite model and establish approximate duality relations under the generalized convexity assumptions and using the notion of the approximate <em>M</em>-stationary point.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"62 ","pages":"Article 107324"},"PeriodicalIF":0.8,"publicationDate":"2025-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144364856","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学术官方微信