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

Operations Research Letters最新文献

筛选
英文 中文
New facets of the clique partitioning polytope 团分割多面体的新面
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-01-16 DOI: 10.1016/j.orl.2025.107242
Adam N. Letchford , Michael M. Sørensen
{"title":"New facets of the clique partitioning polytope","authors":"Adam N. Letchford ,&nbsp;Michael M. Sørensen","doi":"10.1016/j.orl.2025.107242","DOIUrl":"10.1016/j.orl.2025.107242","url":null,"abstract":"<div><div>The clique partitioning problem is a combinatorial optimisation problem which has many applications. At present, the most promising exact algorithms are those that are based on an understanding of the associated polytope. We present two new families of valid inequalities for that polytope, and show that the inequalities define facets under certain conditions.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"59 ","pages":"Article 107242"},"PeriodicalIF":0.8,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143164015","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
Smoothed analysis of the k-swap neighborhood for makespan scheduling 最大时间跨度调度的k-swap邻域平滑分析
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-01-15 DOI: 10.1016/j.orl.2025.107244
Lars Rohwedder , Ashkan Safari , Tjark Vredeveld
{"title":"Smoothed analysis of the k-swap neighborhood for makespan scheduling","authors":"Lars Rohwedder ,&nbsp;Ashkan Safari ,&nbsp;Tjark Vredeveld","doi":"10.1016/j.orl.2025.107244","DOIUrl":"10.1016/j.orl.2025.107244","url":null,"abstract":"<div><div>In this paper, we address the problem of scheduling a set of <em>n</em> jobs on <em>m</em> identical parallel machines with the objective of makespan minimization, by considering a local search neighborhood, called <em>k</em>-swap. In our previous study, we provided an exponential lower bound of <span><math><msup><mrow><mn>2</mn></mrow><mrow><mi>Ω</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow></msup></math></span> for <span><math><mi>k</mi><mo>≥</mo><mn>3</mn></math></span>. In this study, we show that the smoothed number of iterations in finding a local optimum with respect to the <em>k</em>-swap neighborhood is <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>m</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>⋅</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn><mi>k</mi><mo>+</mo><mn>2</mn></mrow></msup><mo>⋅</mo><mi>log</mi><mo>⁡</mo><mi>m</mi><mo>⋅</mo><mi>ϕ</mi><mo>)</mo></math></span>, where <span><math><mi>ϕ</mi><mo>≥</mo><mn>1</mn></math></span> is the perturbation parameter.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"59 ","pages":"Article 107244"},"PeriodicalIF":0.8,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143164392","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
Correlated equilibrium of games with concave potential functions 凹势函数博弈的相关均衡
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-01-14 DOI: 10.1016/j.orl.2025.107241
Zhigang Cao , Zhibin Tan , Jinchuan Zhou
{"title":"Correlated equilibrium of games with concave potential functions","authors":"Zhigang Cao ,&nbsp;Zhibin Tan ,&nbsp;Jinchuan Zhou","doi":"10.1016/j.orl.2025.107241","DOIUrl":"10.1016/j.orl.2025.107241","url":null,"abstract":"<div><div>Neyman (1997) proves in a classical paper that, under certain mild regularity conditions, any strategic game with a smooth strictly concave potential function has a unique correlated equilibrium. We generalize this result by relaxing the smoothness condition, allowing the potential function to include a second part that is not necessarily smoothly concave but separably concave.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"60 ","pages":"Article 107241"},"PeriodicalIF":0.8,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143172986","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
Outer approximation for generalized convex mixed-integer nonlinear robust optimization problems 广义凸混合整数非线性鲁棒优化问题的外逼近
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-01-14 DOI: 10.1016/j.orl.2025.107243
Martina Kuchlbauer
{"title":"Outer approximation for generalized convex mixed-integer nonlinear robust optimization problems","authors":"Martina Kuchlbauer","doi":"10.1016/j.orl.2025.107243","DOIUrl":"10.1016/j.orl.2025.107243","url":null,"abstract":"<div><div>We consider mixed-integer nonlinear robust optimization problems with nonconvexities. In detail, the functions can be nonsmooth and generalized convex, i.e., <span><math><msup><mrow><mi>f</mi></mrow><mrow><mo>∘</mo></mrow></msup></math></span>-quasiconvex or <span><math><msup><mrow><mi>f</mi></mrow><mrow><mo>∘</mo></mrow></msup></math></span>-pseudoconvex. We propose a robust optimization method that requires no certain structure of the adversarial problem, but only approximate worst-case evaluations. The method integrates a bundle method, for continuous subproblems, into an outer approximation approach. We prove that our algorithm converges and finds an approximately robust optimal solution and propose robust gas transport as a suitable application.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"60 ","pages":"Article 107243"},"PeriodicalIF":0.8,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143172985","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
Inventory placement on a network 在网络上放置库存
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-01-09 DOI: 10.1016/j.orl.2025.107240
John R. Birge, Levi DeValve
{"title":"Inventory placement on a network","authors":"John R. Birge,&nbsp;Levi DeValve","doi":"10.1016/j.orl.2025.107240","DOIUrl":"10.1016/j.orl.2025.107240","url":null,"abstract":"<div><div>We consider the problem of placing inventory on a network in advance of uncertain demand, in order to minimize the sum of inventory placement costs and expected fulfillment and shortage costs. Complexity results (in terms of inapproximability lower bounds) are derived under different assumptions. Then we develop two approximation guarantees: one is asymptotically optimal as demand grows large, and the other provides a constant guarantee with metric fulfillment costs.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"60 ","pages":"Article 107240"},"PeriodicalIF":0.8,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143172984","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
Assortment optimization under the multinomial logit choice model with product-specific capacities 基于产品容量的多项逻辑选择模型下的产品分类优化
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-01-02 DOI: 10.1016/j.orl.2024.107238
Woonghee Tim Huh , Siyue Liu
{"title":"Assortment optimization under the multinomial logit choice model with product-specific capacities","authors":"Woonghee Tim Huh ,&nbsp;Siyue Liu","doi":"10.1016/j.orl.2024.107238","DOIUrl":"10.1016/j.orl.2024.107238","url":null,"abstract":"<div><div>We consider assortment optimization with product-specific capacities under the multinomial logit (MNL) choice model, wherein each product has a finite capacity, i.e., a limited number of units for sale. The number of customers served by each product is the smaller of its demand and capacity. We assume the demand of each product is deterministic as a function of the assortment offered. We show that this assortment optimization problem is NP-hard. We devise a 1/2-approximation algorithm and a fully polynomial-time approximation scheme (FPTAS) by exploiting its connection to a series of knapsack problems.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"59 ","pages":"Article 107238"},"PeriodicalIF":0.8,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143164395","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
Pricing filtering in Dantzig-Wolfe decomposition dantzigg - wolfe分解中的定价过滤
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-01-01 DOI: 10.1016/j.orl.2024.107207
Abdellah Bulaich Mehamdi , Mathieu Lacroix , Sébastien Martin
{"title":"Pricing filtering in Dantzig-Wolfe decomposition","authors":"Abdellah Bulaich Mehamdi ,&nbsp;Mathieu Lacroix ,&nbsp;Sébastien Martin","doi":"10.1016/j.orl.2024.107207","DOIUrl":"10.1016/j.orl.2024.107207","url":null,"abstract":"<div><div>Column generation is used alongside Dantzig-Wolfe Decomposition, especially for linear programs having a decomposable pricing step requiring to solve numerous independent pricing subproblems. We propose a filtering method to detect which pricing subproblems may have improving columns, and only those subproblems are solved during pricing. This filtering is done by providing light, computable bounds using dual information from previous iterations of the column generation. The experiments show a significant impact on different combinatorial optimization problems.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"58 ","pages":"Article 107207"},"PeriodicalIF":0.8,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143166897","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 the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables 研究了以边缘变量表示的分割配送车辆路径问题解的可行性
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-01-01 DOI: 10.1016/j.orl.2024.107209
Artur Pessoa, Daniel de Araujo, Eduardo Uchoa
{"title":"On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables","authors":"Artur Pessoa,&nbsp;Daniel de Araujo,&nbsp;Eduardo Uchoa","doi":"10.1016/j.orl.2024.107209","DOIUrl":"10.1016/j.orl.2024.107209","url":null,"abstract":"<div><div>Mixed integer programming formulations for the Split Delivery Vehicle Routing Problem (SDVRP) typically use edge decision variables. It was believed that feasibility couldn't be verified in polynomial time. We show that this recognition problem depends on the formulation's constraints and prove that it's strongly NP-hard for a recent formulation. With subtour elimination constraints, we provide an <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span>-time recognition algorithm. This challenges assumptions about edge-based formulations and provides new insights into SDVRP solution verification complexity.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"58 ","pages":"Article 107209"},"PeriodicalIF":0.8,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143166898","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 the capacity inequalities for the heterogeneous vehicle routing problem 异构车辆路径问题的容量不等式
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-12-30 DOI: 10.1016/j.orl.2024.107239
Konstantin Pavlikov
{"title":"On the capacity inequalities for the heterogeneous vehicle routing problem","authors":"Konstantin Pavlikov","doi":"10.1016/j.orl.2024.107239","DOIUrl":"10.1016/j.orl.2024.107239","url":null,"abstract":"<div><div>Fractional and Rounded capacity inequalities are two important families of valid inequalities known for the homogeneous Capacitated Vehicle Routing Problem (CVRP). Such inequalities impose the minimum number of vehicles required to service each and every subset of customers, be it a fractional or an integer value. In case of the Heterogeneous version of the routing problem (HCVRP), the minimum number of vehicles required for a subset of customers is not defined uniquely: it depends on the vehicle types and fleet composition that was engaged in serving the customers. This paper revises existing literature on the capacity-based valid inequalities for the HCVRP and presents new routines to separate them exactly using mixed integer linear programming (MILP). In addition, this paper proposes a new family of capacity-based valid inequalities for the HCVRP together with an exact routine to separate them. A computational study demonstrates applicability of considered inequalities in solving HCVRP instances using a standard MILP solver.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"59 ","pages":"Article 107239"},"PeriodicalIF":0.8,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143164396","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
Distributionally robust stochastic optimal control 分布鲁棒随机最优控制
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-12-27 DOI: 10.1016/j.orl.2024.107234
Alexander Shapiro , Yan Li
{"title":"Distributionally robust stochastic optimal control","authors":"Alexander Shapiro ,&nbsp;Yan Li","doi":"10.1016/j.orl.2024.107234","DOIUrl":"10.1016/j.orl.2024.107234","url":null,"abstract":"<div><div>The main goal of this paper is to discuss construction of distributionally robust counterparts of stochastic optimal control problems. Randomized and non-randomized policies are considered. In particular necessary and sufficient conditions for existence of non-randomized policies are given.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"60 ","pages":"Article 107234"},"PeriodicalIF":0.8,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143172983","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学术官方微信