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

Operations Research Letters最新文献

筛选
英文 中文
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
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
Optimal allocation of active and standby redundancies in series systems
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-12-20 DOI: 10.1016/j.orl.2024.107237
Biplab Hawlader , Pradip Kundu , Amarjit Kundu
{"title":"Optimal allocation of active and standby redundancies in series systems","authors":"Biplab Hawlader ,&nbsp;Pradip Kundu ,&nbsp;Amarjit Kundu","doi":"10.1016/j.orl.2024.107237","DOIUrl":"10.1016/j.orl.2024.107237","url":null,"abstract":"<div><div>This research focuses on determining the optimal allocation of redundancies within a system, strategically placing them to enhance system performance. The paper explores redundancy allocation strategies through stochastic comparisons of resulting system lifetimes in various stochastic orders. While previous studies mainly focused on two or <em>n</em>-component series systems with some specific distributions for component lifetimes, this study extends the investigation with arbitrary distributions or some semiparametric families. It presents some new and extended results, offering novel insights to the topic.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"60 ","pages":"Article 107237"},"PeriodicalIF":0.8,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143172982","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
Extended formulations for the integer hull of strictly Δ-modular cographic polyhedral cones
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-12-19 DOI: 10.1016/j.orl.2024.107235
Joseph Paat , Zach Walsh , Luze Xu
{"title":"Extended formulations for the integer hull of strictly Δ-modular cographic polyhedral cones","authors":"Joseph Paat ,&nbsp;Zach Walsh ,&nbsp;Luze Xu","doi":"10.1016/j.orl.2024.107235","DOIUrl":"10.1016/j.orl.2024.107235","url":null,"abstract":"<div><div>Conforti et al. give a compact extended formulation for a class of bimodular-constrained integer programs, namely those that model the stable set polytope of a graph with no disjoint odd cycles. We extend their techniques to design compact extended formulations for the integer hull of translated polyhedral cones whose constraint matrix is strictly Δ-modular and has rows that represent a cographic matroid. Our work generalizes the important special case from Conforti et al. concerning 4-connected graphs with odd cycle transversal number at least 4. We also discuss the necessity of our assumptions.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"60 ","pages":"Article 107235"},"PeriodicalIF":0.8,"publicationDate":"2024-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143172980","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
Strategic behavior in a time-limited Markovian polling queue with service rate regeneration
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-12-18 DOI: 10.1016/j.orl.2024.107236
Yuanyuan Liu, Zhaozeng Yan
{"title":"Strategic behavior in a time-limited Markovian polling queue with service rate regeneration","authors":"Yuanyuan Liu,&nbsp;Zhaozeng Yan","doi":"10.1016/j.orl.2024.107236","DOIUrl":"10.1016/j.orl.2024.107236","url":null,"abstract":"<div><div>This paper studies a time-limited Markovian polling queueing system with service rate regeneration. When the server moves to a new station, it announces the next station to open based on a given discrete-time Markov chain. We calculate the expected waiting time for customers in each queue, which is shown to be monotonic with respect to their position in the queue. Personal optimal thresholds for the customers are then determined, and an optimal joining strategy is proposed based on these thresholds.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"60 ","pages":"Article 107236"},"PeriodicalIF":0.8,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143172981","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
Low-rank extragradient methods for scalable semidefinite optimization
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-12-13 DOI: 10.1016/j.orl.2024.107230
Dan Garber, Atara Kaplan
{"title":"Low-rank extragradient methods for scalable semidefinite optimization","authors":"Dan Garber,&nbsp;Atara Kaplan","doi":"10.1016/j.orl.2024.107230","DOIUrl":"10.1016/j.orl.2024.107230","url":null,"abstract":"<div><div>We consider a class of important semidefinite optimization problems that involve a convex smooth or nonsmooth objective function and linear constraints. Focusing on high-dimensional settings with a low-rank solution that also satisfies a low-rank complementarity condition, we prove that the well-known Extragradient method, when initialized with a “warm-start”, converges with its standard convergence rate guarantees, using only efficient low-rank singular value decompositions to project onto the positive semidefinite cone. Supporting numerical evidence with a dataset of Max-Cut instances is provided.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"60 ","pages":"Article 107230"},"PeriodicalIF":0.8,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143140227","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学术官方微信