Pub Date : 2025-11-01Epub Date: 2025-09-16DOI: 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 , Hassan L. Hijazi , 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-11-01","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}
Pub Date : 2025-11-01Epub Date: 2025-09-11DOI: 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.
{"title":"Subgame perfect Nash equilibrium analysis in a two-population strategic matching queue with nonzero matching times","authors":"Hung Q. Nguyen , 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-11-01","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}
Pub Date : 2025-11-01Epub Date: 2025-09-11DOI: 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 , Yong Zhao , Liping Tang , 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-11-01","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}
Pub Date : 2025-11-01Epub Date: 2025-08-08DOI: 10.1016/j.orl.2025.107352
Eugene T.Y. Ang , Yifan Feng
This paper investigates sparse network designs that support large matchings under adversarial vertex deletions. We find that while connected structures (e.g., chain-type graphs) can be optimal when sparsity constraints are less stringent, disconnected structures (e.g., cluster-type 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.
{"title":"Disconnectedness Brings Robustness? On Network Design For Matching With Vertex Interdiction","authors":"Eugene T.Y. Ang , 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-11-01","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}
Pub Date : 2025-11-01Epub Date: 2025-07-29DOI: 10.1016/j.orl.2025.107348
Rayen Tan , Alex Xu , Viswanath Nagarajan
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 fraction loss in the approximation ratio. Combined with previously-known approximation algorithms in the classic setting, we obtain batched algorithms for AND, k-of-n and score-classification functions with approximation ratios 1.707, 2.618 and 6.371 respectively. Our algorithm is very efficient, running in time for all the aforementioned functions.
{"title":"A general framework for sequential batch-testing","authors":"Rayen Tan , Alex Xu , 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-11-01","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}
Pub Date : 2025-11-01Epub Date: 2025-08-22DOI: 10.1016/j.orl.2025.107357
Amir Beck, Omer Noam
We consider the support vector data description problem which, given a set of data points, seeks to find a ball that minimizes an objective function incorporating both the radius of the ball and a penalty for any data point located outside the ball. We present a reduction of the problem to an unconstrained minimization of a strongly convex function, enabling it to be solved by a dual-based accelerated gradient method.
{"title":"A note on the support vector data description problem","authors":"Amir Beck, Omer Noam","doi":"10.1016/j.orl.2025.107357","DOIUrl":"10.1016/j.orl.2025.107357","url":null,"abstract":"<div><div>We consider the support vector data description problem which, given a set of data points, seeks to find a ball that minimizes an objective function incorporating both the radius of the ball and a penalty for any data point located outside the ball. We present a reduction of the problem to an unconstrained minimization of a strongly convex function, enabling it to be solved by a dual-based accelerated gradient method.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107357"},"PeriodicalIF":0.9,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144896686","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}
Pub Date : 2025-09-01Epub Date: 2025-06-27DOI: 10.1016/j.orl.2025.107325
Paul Revenant , Hadrien Cambazard , Nicolas Catusse
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.
{"title":"A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses","authors":"Paul Revenant , Hadrien Cambazard , 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-09-01","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}
Pub Date : 2025-09-01Epub Date: 2025-05-30DOI: 10.1016/j.orl.2025.107310
Immanuel M. Bomze , Daniel de Vicente
The standard quadratic optimization problem (StQP) consists of minimizing a quadratic form over the standard simplex. Without convexity or concavity of the quadratic form, the StQP is NP-hard. This problem has many relevant real-life applications ranging from portfolio optimization to pairwise clustering and replicator dynamics.
Sometimes, the data matrix is uncertain. We investigate models where the distribution of the data matrix is known but where both the StQP after realization of the data matrix and the here-and-now problem are indefinite.
{"title":"Uncertain standard quadratic optimization under distributional assumptions: A chance-constrained epigraphic approach","authors":"Immanuel M. Bomze , Daniel de Vicente","doi":"10.1016/j.orl.2025.107310","DOIUrl":"10.1016/j.orl.2025.107310","url":null,"abstract":"<div><div>The standard quadratic optimization problem (StQP) consists of minimizing a quadratic form over the standard simplex. Without convexity or concavity of the quadratic form, the StQP is NP-hard. This problem has many relevant real-life applications ranging from portfolio optimization to pairwise clustering and replicator dynamics.</div><div>Sometimes, the data matrix is uncertain. We investigate models where the distribution of the data matrix is known but where both the StQP after realization of the data matrix and the here-and-now problem are indefinite.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"62 ","pages":"Article 107310"},"PeriodicalIF":0.8,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144195870","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}
Pub Date : 2025-09-01Epub Date: 2025-05-27DOI: 10.1016/j.orl.2025.107307
Yang Yang , Mikhail Y. Kovalyov , Yong Zhang
The budgeted laminar matroid independent set problem seeks to maximize the total profit of a cardinality constrained independent set within a laminar matroid, subject to a budget on total cost. A pseudo-polynomial DP algorithm and an FPTAS were recently proposed for this problem. We extract properties of these algorithms and reduce the running time of the FPTAS from to , where S is the ground set and ε is the relative error.
{"title":"An improved FPTAS for budgeted laminar matroid independent set","authors":"Yang Yang , Mikhail Y. Kovalyov , Yong Zhang","doi":"10.1016/j.orl.2025.107307","DOIUrl":"10.1016/j.orl.2025.107307","url":null,"abstract":"<div><div>The budgeted laminar matroid independent set problem seeks to maximize the total profit of a cardinality constrained independent set within a laminar matroid, subject to a budget on total cost. A pseudo-polynomial DP algorithm and an FPTAS were recently proposed for this problem. We extract properties of these algorithms and reduce the running time of the FPTAS from <span><math><mi>O</mi><mrow><mo>(</mo><msup><mrow><mo>|</mo><mi>S</mi><mo>|</mo></mrow><mrow><mn>7</mn></mrow></msup><msup><mrow><mi>ε</mi></mrow><mrow><mo>−</mo><mn>2</mn></mrow></msup><mo>)</mo></mrow></math></span> to <span><math><mi>O</mi><mrow><mo>(</mo><msup><mrow><mo>|</mo><mi>S</mi><mo>|</mo></mrow><mrow><mn>5</mn></mrow></msup><msup><mrow><mi>ε</mi></mrow><mrow><mo>−</mo><mn>2</mn></mrow></msup><mo>+</mo><msup><mrow><mo>|</mo><mi>S</mi><mo>|</mo></mrow><mrow><mn>5</mn></mrow></msup><msub><mrow><mi>log</mi></mrow><mrow><mn>2</mn></mrow></msub><mo></mo><mrow><mo>|</mo><mi>S</mi><mo>|</mo></mrow><mo>)</mo></mrow></math></span>, where <em>S</em> is the ground set and <em>ε</em> is the relative error.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"62 ","pages":"Article 107307"},"PeriodicalIF":0.8,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144147776","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}
Pub Date : 2025-09-01Epub Date: 2025-06-12DOI: 10.1016/j.orl.2025.107323
John Cotrina , Carlos Calderón
In this paper, we focus on the concept of projected solutions in generalized Nash games and examine their relationship with generalized Nash equilibria. We also establish the existence of projected solutions through an elegant reformulation that allows the use of a result by Arrow and Debreu. Finally, abstract economy is considered as an application.
{"title":"Remarks on projected solutions in generalized Nash games","authors":"John Cotrina , Carlos Calderón","doi":"10.1016/j.orl.2025.107323","DOIUrl":"10.1016/j.orl.2025.107323","url":null,"abstract":"<div><div>In this paper, we focus on the concept of projected solutions in generalized Nash games and examine their relationship with generalized Nash equilibria. We also establish the existence of projected solutions through an elegant reformulation that allows the use of a result by Arrow and Debreu. Finally, abstract economy is considered as an application.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"62 ","pages":"Article 107323"},"PeriodicalIF":0.8,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144298175","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}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号