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

Operations Research Letters最新文献

筛选
英文 中文
Optimal design of vaccination policies: A case study for Newfoundland and Labrador 疫苗接种政策的优化设计：纽芬兰和拉布拉多案例研究
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-07-01 DOI: 10.1016/j.orl.2024.107140
Faraz Khoshbakhtian , Hamidreza Validi , Mario Ventresca , Dionne Aleman
{"title":"Optimal design of vaccination policies: A case study for Newfoundland and Labrador","authors":"Faraz Khoshbakhtian ,&nbsp;Hamidreza Validi ,&nbsp;Mario Ventresca ,&nbsp;Dionne Aleman","doi":"10.1016/j.orl.2024.107140","DOIUrl":"10.1016/j.orl.2024.107140","url":null,"abstract":"<div><p>This paper proposes pandemic mitigation vaccination policies for Newfoundland and Labrador (NL) based on two compact mixed integer programming (MIP) models of the distance-based critical node detection problem (DCNDP). Our main focus is on two variants of the DCNDP that seek to minimize the number of connections with lengths of at most one (1-DCNDP) and two (2-DCNDP). A polyhedral study for the 1-DCNDP is conducted, and new aggregated inequalities are provided for the 2-DCNDP. The computational experiments show that the 2-DCNDP with aggregated inequalities outperforms the one with disaggregated inequalities for graphs with a density of at least 0.5%. We also study the strategic vaccine allocation problem as a real-world application of the DCNDP and conduct a set of computational experiments on a simulated contact network of NL. Our computational results demonstrate that the DCNDP-based strategies can have a better performance in comparison with the real-world strategies implemented during COVID-19.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"55 ","pages":"Article 107140"},"PeriodicalIF":0.8,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141613970","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
Fairness in accessibility of public service facilities 公平享用公共服务设施
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-07-01 DOI: 10.1016/j.orl.2024.107141
Sheng Liu , Nooshin Salari
{"title":"Fairness in accessibility of public service facilities","authors":"Sheng Liu ,&nbsp;Nooshin Salari","doi":"10.1016/j.orl.2024.107141","DOIUrl":"10.1016/j.orl.2024.107141","url":null,"abstract":"<div><p>Our paper studies a fair stochastic facility location problem with congestion under the max-min principle. We analyze the price of fairness in a two-location problem and develop a tractable optimization framework for the general multi-location setting. Evaluating the fair solution against the utilitarian solution on Buffalo's demographic data reveals that implementing a fair solution can substantially improve fairness measures (up to 98%) with relatively limited impact on the overall service quality.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"55 ","pages":"Article 107141"},"PeriodicalIF":0.8,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141613971","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
Almost tight bounds for online hypergraph matching 在线超图匹配的近似紧约束
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-07-01 DOI: 10.1016/j.orl.2024.107143
Thorben Tröbst , Rajan Udwani
{"title":"Almost tight bounds for online hypergraph matching","authors":"Thorben Tröbst ,&nbsp;Rajan Udwani","doi":"10.1016/j.orl.2024.107143","DOIUrl":"10.1016/j.orl.2024.107143","url":null,"abstract":"<div><p>In the online hypergraph matching problem, hyperedges of size <em>k</em> over a common ground set arrive online in adversarial order. The goal is to obtain a maximum matching (disjoint set of hyperedges). A naïve greedy algorithm for this problem achieves a competitive ratio of <span><math><mfrac><mrow><mn>1</mn></mrow><mrow><mi>k</mi></mrow></mfrac></math></span>. We show that no (randomized) online algorithm has competitive ratio better than <span><math><mfrac><mrow><mn>2</mn><mo>+</mo><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></mrow><mrow><mi>k</mi></mrow></mfrac></math></span>. If edges are allowed to be assigned fractionally, we give a deterministic online algorithm with competitive ratio <span><math><mfrac><mrow><mn>1</mn><mo>−</mo><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></mrow><mrow><mi>ln</mi><mo>⁡</mo><mo>(</mo><mi>k</mi><mo>)</mo></mrow></mfrac></math></span> and show that no online algorithm can have competitive ratio strictly better than <span><math><mfrac><mrow><mn>1</mn><mo>+</mo><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></mrow><mrow><mi>ln</mi><mo>⁡</mo><mo>(</mo><mi>k</mi><mo>)</mo></mrow></mfrac></math></span>. Lastly, we give a <span><math><mfrac><mrow><mn>1</mn><mo>−</mo><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></mrow><mrow><mi>ln</mi><mo>⁡</mo><mo>(</mo><mi>k</mi><mo>)</mo></mrow></mfrac></math></span> competitive algorithm for the fractional <em>edge-weighted</em> version of the problem under a free disposal assumption.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"55 ","pages":"Article 107143"},"PeriodicalIF":0.8,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141784858","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
Uncertainty reduction in robust optimization 减少稳健优化中的不确定性
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-07-01 DOI: 10.1016/j.orl.2024.107131
Ayşe N. Arslan , Michael Poss
{"title":"Uncertainty reduction in robust optimization","authors":"Ayşe N. Arslan ,&nbsp;Michael Poss","doi":"10.1016/j.orl.2024.107131","DOIUrl":"10.1016/j.orl.2024.107131","url":null,"abstract":"<div><p>Uncertainty reduction has recently been introduced in the robust optimization literature as a relevant special case of decision-dependent uncertainty. Herein, we identify two relevant situations in which the problem is polynomially solvable. We further provide insights into possible MILP reformulations and the strength of their continuous relaxations.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"55 ","pages":"Article 107131"},"PeriodicalIF":0.8,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141507237","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
CABRA: Clustering algorithm based on regular arrangement CABRA：基于规则排列的聚类算法
IF 1.1 4区 管理学
Operations Research Letters Pub Date : 2024-06-12 DOI: 10.1016/j.orl.2024.107137
Jorge C-Rella
{"title":"CABRA: Clustering algorithm based on regular arrangement","authors":"Jorge C-Rella","doi":"10.1016/j.orl.2024.107137","DOIUrl":"10.1016/j.orl.2024.107137","url":null,"abstract":"<div><p>Clustering is an unsupervised learning technique for organizing complex datasets into coherent groups. A novel clustering algorithm is presented, with a simple grouping concept depending on only one hyperparameter, which makes it suitable for further extensions to any topology and space. It is compared to state-of-the-art algorithms, overall achieving a better performance independently on the structure and complexity of the data, making the proposed algorithm a valuable tool for real applications such as market segmentation, sentiment analysis and anomaly detection.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"55 ","pages":"Article 107137"},"PeriodicalIF":1.1,"publicationDate":"2024-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167637724000737/pdfft?md5=b65e1ded4697916bc6af8d82b5777240&pid=1-s2.0-S0167637724000737-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141402919","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
Implied volatility slopes and jumps in bitcoin options market 比特币期权市场隐含波动率的倾斜和跳跃
IF 1.1 4区 管理学
Operations Research Letters Pub Date : 2024-06-06 DOI: 10.1016/j.orl.2024.107135
Tian Chen, Jun Deng, Jing Nie
{"title":"Implied volatility slopes and jumps in bitcoin options market","authors":"Tian Chen,&nbsp;Jun Deng,&nbsp;Jing Nie","doi":"10.1016/j.orl.2024.107135","DOIUrl":"10.1016/j.orl.2024.107135","url":null,"abstract":"<div><p>This paper derives a theoretical relation between the left and right slopes of the implied volatility curve with negative and positive price jumps. Empirical analysis using bitcoin options tick-by-tick data from Deribit exchange supported the theoretical findings that negative and positive jumps have reversal impacts on bitcoin options' implied volatility slopes even after the control of net-buying-pressure and realized positive and negative skewness measures.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"55 ","pages":"Article 107135"},"PeriodicalIF":1.1,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141411081","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
Computing a common prior 计算共同先验
IF 1.1 4区 管理学
Operations Research Letters Pub Date : 2024-05-31 DOI: 10.1016/j.orl.2024.107134
Marianna E.-Nagy , Miklós Pintér
{"title":"Computing a common prior","authors":"Marianna E.-Nagy ,&nbsp;Miklós Pintér","doi":"10.1016/j.orl.2024.107134","DOIUrl":"https://doi.org/10.1016/j.orl.2024.107134","url":null,"abstract":"<div><p>Morris (1994) and Feinberg (2000) showed that a finite type space admits a common prior if and only if there is no agreeable bet in it.</p><p>We also consider finite type spaces and observe that the problem of computing a common prior is equivalent to considering the intersection of affine spaces spanned by the types of a player. Therefore, we can apply the Fredholm alternative and conclude that the computational complexity of computing a common prior is strongly polynomial.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"55 ","pages":"Article 107134"},"PeriodicalIF":1.1,"publicationDate":"2024-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141264135","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
Circulant TSP special cases: Easily-solvable cases and improved approximations 循环 TSP 特殊情况：易于解决的案例和改进的近似值
IF 1.1 4区 管理学
Operations Research Letters Pub Date : 2024-05-31 DOI: 10.1016/j.orl.2024.107133
Austin Beal, Yacine Bouabida, Samuel C. Gutekunst, Asta Rustad
{"title":"Circulant TSP special cases: Easily-solvable cases and improved approximations","authors":"Austin Beal,&nbsp;Yacine Bouabida,&nbsp;Samuel C. Gutekunst,&nbsp;Asta Rustad","doi":"10.1016/j.orl.2024.107133","DOIUrl":"https://doi.org/10.1016/j.orl.2024.107133","url":null,"abstract":"<div><p>Circulant TSP is an intriguing special case of the Traveling Salesman Problem, whose complexity remains an often-cited open problem. In this note, we present three results: We show that circulant TSP can be efficiently solved whenever the input number of vertices is a prime-squared; we show that the <span><math><mo>{</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>}</mo></math></span>-TSP can be easily and efficiently solved when specialized to circulant instances; and we present a substantially-improved approximation factor for finding a minimum-cost Eulerian connected sub-(multi)graph on two-stripe circulant instances.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"55 ","pages":"Article 107133"},"PeriodicalIF":1.1,"publicationDate":"2024-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141314968","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 evaluation and optimization of integer-ratio policies for stochastic one-warehouse multiple-retailer inventory systems 随机一仓库多零售商库存系统整数比率政策的精确评估与优化
IF 1.1 4区 管理学
Operations Research Letters Pub Date : 2024-05-28 DOI: 10.1016/j.orl.2024.107132
Qinan Wang , Zihan Zhou , Guangyu Wan
{"title":"Exact evaluation and optimization of integer-ratio policies for stochastic one-warehouse multiple-retailer inventory systems","authors":"Qinan Wang ,&nbsp;Zihan Zhou ,&nbsp;Guangyu Wan","doi":"10.1016/j.orl.2024.107132","DOIUrl":"https://doi.org/10.1016/j.orl.2024.107132","url":null,"abstract":"<div><p>This paper considers one-warehouse multiple-retailer inventory systems. The retailers are non-identical and face Poisson demand processes. We consider an integer-ratio policy in which each retailer orders in a fixed interval that is either an integer or integer-ratio multiple of the warehouse's reorder interval. Base-stock policy and virtual allocation are assumed. We show that cost evaluations at the retailers are completely separable, leading to a simple approach to develop an optimal integer-ratio policy for a two-level distribution system with heterogeneous retailers.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"55 ","pages":"Article 107132"},"PeriodicalIF":1.1,"publicationDate":"2024-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141298327","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 bipartite travelling salesman problem: A pyramidally solvable case 二方旅行推销员问题：金字塔式可解案例
IF 1.1 4区 管理学
Operations Research Letters Pub Date : 2024-05-27 DOI: 10.1016/j.orl.2024.107130
Vladimir G. Deineko , Bettina Klinz , Gerhard J. Woeginger
{"title":"The bipartite travelling salesman problem: A pyramidally solvable case","authors":"Vladimir G. Deineko ,&nbsp;Bettina Klinz ,&nbsp;Gerhard J. Woeginger","doi":"10.1016/j.orl.2024.107130","DOIUrl":"https://doi.org/10.1016/j.orl.2024.107130","url":null,"abstract":"<div><p>Given <em>k</em> blue cities, <em>k</em> red cities and a <span><math><mn>2</mn><mi>k</mi><mo>×</mo><mn>2</mn><mi>k</mi></math></span> distance matrix, the task in the bipartite travelling salesman problem is to find a shortest tour which alternately visits blue and red cities. We consider the special case of Van der Veen distance matrices and show that it remains NP-hard in general but can be solved in <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span> time when all vertices with odd indices are blue and all with even indices are red.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"55 ","pages":"Article 107130"},"PeriodicalIF":1.1,"publicationDate":"2024-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S016763772400066X/pdfft?md5=c5ebab7f8ed20ec28056efd78f98f6f7&pid=1-s2.0-S016763772400066X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141243572","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
首页 上一页 下一页 尾页
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学术官方微信