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

Operations Research Letters最新文献

筛选
英文 中文
On a variant of the change-making problem 关于变革问题的一个变式
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-08-26 DOI: 10.1016/j.orl.2024.107165
Adam N. Letchford , Licong Cheng
{"title":"On a variant of the change-making problem","authors":"Adam N. Letchford ,&nbsp;Licong Cheng","doi":"10.1016/j.orl.2024.107165","DOIUrl":"10.1016/j.orl.2024.107165","url":null,"abstract":"<div><p>The <em>change-making problem</em> (CMP), introduced in 1970, is a classic problem in combinatorial optimisation. It was proven to be <em>NP</em>-hard in 1975, but it can be solved in pseudo-polynomial time by dynamic programming. In 1999, Heipcke presented a variant of the CMP which, at first glance, looks harder than the standard version. We show that, in fact, her variant can be solved in polynomial time.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107165"},"PeriodicalIF":0.8,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167637724001019/pdfft?md5=e0e9fdd931b3a9fcee0ea8ad8811494d&pid=1-s2.0-S0167637724001019-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142096267","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
Proximity guarantees of a lift-and-project approach for the cardinality-constrained Boolean quadric polytope 针对有数量限制的布尔四元多面体的举一反三法的邻近性保证
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-08-26 DOI: 10.1016/j.orl.2024.107166
Walid Ben-Ameur
{"title":"Proximity guarantees of a lift-and-project approach for the cardinality-constrained Boolean quadric polytope","authors":"Walid Ben-Ameur","doi":"10.1016/j.orl.2024.107166","DOIUrl":"10.1016/j.orl.2024.107166","url":null,"abstract":"<div><p>We consider a lift-and-project approach for the cardinality-constrained Boolean quadric polytope. Some upper bounds for the distance between the polytope and its linear approximation are derived. Unsurprisingly, the distance converges to 0 when the number of variables increases sufficiently.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107166"},"PeriodicalIF":0.8,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142096990","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 principle of optimality in dynamic programming: A pedagogical note 动态编程中的最优原则：教学说明
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-08-23 DOI: 10.1016/j.orl.2024.107164
Bar Light
{"title":"The principle of optimality in dynamic programming: A pedagogical note","authors":"Bar Light","doi":"10.1016/j.orl.2024.107164","DOIUrl":"10.1016/j.orl.2024.107164","url":null,"abstract":"<div><p>The principle of optimality is a fundamental aspect of dynamic programming, which states that the optimal solution to a dynamic optimization problem can be found by combining the optimal solutions to its sub-problems. While this principle is generally applicable, it is often only taught for problems with finite or countable state spaces in order to sidestep measure-theoretic complexities. Therefore, it cannot be applied to classic models such as inventory management and dynamic pricing models that have continuous state spaces, and students may not be aware of the possible challenges involved in studying dynamic programming models with general state spaces. To address this, we provide conditions and a self-contained simple proof that establish when the principle of optimality for discounted dynamic programming is valid. These conditions shed light on the difficulties that may arise in the general state space case. We provide examples from the literature that include the relatively involved case of universally measurable dynamic programming and the simple case of finite dynamic programming where our main result can be applied to show that the principle of optimality holds.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107164"},"PeriodicalIF":0.8,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142084097","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
Endogenous reactive transshipment prices eliminate proactive transshipments and coordinate reactive transshipments 内生的被动转运价格消除了主动转运，协调了被动转运
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-08-22 DOI: 10.1016/j.orl.2024.107160
Metin Çakanyıldırım , Nagihan Çömez-Dolgan , Kathryn E. Stecke
{"title":"Endogenous reactive transshipment prices eliminate proactive transshipments and coordinate reactive transshipments","authors":"Metin Çakanyıldırım ,&nbsp;Nagihan Çömez-Dolgan ,&nbsp;Kathryn E. Stecke","doi":"10.1016/j.orl.2024.107160","DOIUrl":"10.1016/j.orl.2024.107160","url":null,"abstract":"<div><p>This paper studies independent retailers who can cooperate with transshipments. It is the first to prove that retailers can maximize their profits with no proactive transshipments by deploying only reactive transshipments, if and only if reactive transshipment prices are endogenous. Retailers seek mutually acceptable prices for reactive transshipments. A time and inventory-dependent price interval, if non-empty, includes all of the coordinating reactive transshipment prices that yield the centralized profit; if empty, reactive transshipment is unacceptable for one of the retailers.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107160"},"PeriodicalIF":0.8,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142129852","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
Nonparametric data-driven learning algorithms for multilocation inventory systems 多地点库存系统的非参数数据驱动学习算法
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-08-22 DOI: 10.1016/j.orl.2024.107163
Zijun Zhong , Zhou He
{"title":"Nonparametric data-driven learning algorithms for multilocation inventory systems","authors":"Zijun Zhong ,&nbsp;Zhou He","doi":"10.1016/j.orl.2024.107163","DOIUrl":"10.1016/j.orl.2024.107163","url":null,"abstract":"<div><p>We study a multilocation inventory system with unknown demand distribution using a nonparametric approach. The system consists of multiple distribution centers and customer locations, where products are shipped from the distribution centers to fulfill customer demands. We propose a novel algorithm, DMLI, for adaptive inventory management. Under specific conditions, we establish that the average expected <em>T</em>-period regret of DMLI converges to the optimal rate of <span><math><mi>O</mi><mo>(</mo><mn>1</mn><mo>/</mo><msqrt><mrow><mi>T</mi></mrow></msqrt><mo>)</mo></math></span>.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107163"},"PeriodicalIF":0.8,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142096991","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
Leveraging platform intermediaries for licensing in technology-intensive supply chains with network effects 在具有网络效应的技术密集型供应链中利用平台中介发放许可
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-08-22 DOI: 10.1016/j.orl.2024.107161
Chung-Chi Hsieh, Sung-Wei Lin
{"title":"Leveraging platform intermediaries for licensing in technology-intensive supply chains with network effects","authors":"Chung-Chi Hsieh,&nbsp;Sung-Wei Lin","doi":"10.1016/j.orl.2024.107161","DOIUrl":"10.1016/j.orl.2024.107161","url":null,"abstract":"<div><p>We examine a technology firm's licensing choices, with or without a platform intermediary, in a market with two competing manufacturers. We analyze how market conditions influence the technology firm's decision, considering its ability to enhance product quality and network effects. We find that licensing through the platform intermediary is beneficial across a wider range of network effects when the gap in the manufacturers' capabilities narrows. Furthermore, this approach enables higher profitability with less effort in certain market conditions.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107161"},"PeriodicalIF":0.8,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142050441","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
Weighted scoring rules for selecting a compatible committee 遴选兼容委员会的加权评分规则
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-08-22 DOI: 10.1016/j.orl.2024.107162
Clinton Gubong Gassi
{"title":"Weighted scoring rules for selecting a compatible committee","authors":"Clinton Gubong Gassi","doi":"10.1016/j.orl.2024.107162","DOIUrl":"10.1016/j.orl.2024.107162","url":null,"abstract":"<div><p>This paper addresses the challenge of integrating the compatibility criterion between candidates into the committee selection process under scoring rules. The compatibility between candidates is considered by assigning each committee a vector of weights based on this criterion. The goal is to choose a committee by taking into account both the compatibility between candidates and their performance based on scores. To achieve this, the paper defines a continuous weighted scoring function characterized by two crucial properties: linearity and independence of zero-weight members.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"56 ","pages":"Article 107162"},"PeriodicalIF":0.8,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142077425","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
Bounded mixed batch scheduling with job release dates and rejection 带作业发布日期和拒绝的有界混合批量调度
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-08-13 DOI: 10.1016/j.orl.2024.107159
Jun Xu , Yong-Xing Huang , Daxing Zhang , Ran Lin , Guo-Qiang Fan
{"title":"Bounded mixed batch scheduling with job release dates and rejection","authors":"Jun Xu ,&nbsp;Yong-Xing Huang ,&nbsp;Daxing Zhang ,&nbsp;Ran Lin ,&nbsp;Guo-Qiang Fan","doi":"10.1016/j.orl.2024.107159","DOIUrl":"10.1016/j.orl.2024.107159","url":null,"abstract":"<div><p>This paper investigates a bounded mixed batch scheduling problem with job release dates and rejection. The machine processes a batch containing several jobs that their number does not exceed the machine capacity. For the case with a certain release date, we present a polynomial-time exact algorithm. For the case with a constant number of release dates, a pseudo-polynomial-time exact algorithm is proposed. For the general problem, we provide a 2-approximation algorithm and a polynomial-time approximation scheme.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107159"},"PeriodicalIF":0.8,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142012448","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
Primal separation and approximation for the {0,1/2}-closure {0,1/2}封闭的原点分离与近似
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-08-06 DOI: 10.1016/j.orl.2024.107156
Lukas Brandl, Andreas S. Schulz
{"title":"Primal separation and approximation for the {0,1/2}-closure","authors":"Lukas Brandl,&nbsp;Andreas S. Schulz","doi":"10.1016/j.orl.2024.107156","DOIUrl":"10.1016/j.orl.2024.107156","url":null,"abstract":"<div><p>The primal separation problem for <span><math><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>/</mo><mn>2</mn><mo>}</mo></math></span>-cuts is: Given a vertex <span><math><mover><mrow><mi>x</mi></mrow><mrow><mo>ˆ</mo></mrow></mover></math></span> of the integer hull of a polytope <em>P</em> and some fractional point <span><math><msup><mrow><mi>x</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>∈</mo><mi>P</mi></math></span>, does there exist a <span><math><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>/</mo><mn>2</mn><mo>}</mo></math></span>-cut that is tight at <span><math><mover><mrow><mi>x</mi></mrow><mrow><mo>ˆ</mo></mrow></mover></math></span> and violated by <span><math><msup><mrow><mi>x</mi></mrow><mrow><mo>⁎</mo></mrow></msup></math></span>? We present two cases for which primal separation is solvable in polynomial time. Furthermore, we show that the optimization problem over the <span><math><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>/</mo><mn>2</mn><mo>}</mo></math></span>-closure can be solved in polynomial time up to a factor <span><math><mo>(</mo><mn>1</mn><mo>+</mo><mi>ε</mi><mo>)</mo></math></span>, for any fixed <span><math><mi>ε</mi><mo>&gt;</mo><mn>0</mn></math></span>.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107156"},"PeriodicalIF":0.8,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167637724000920/pdfft?md5=98126ea14f7cd3986aac3e3d1d1e7424&pid=1-s2.0-S0167637724000920-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141942978","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
Vitali variation error bounds for expected value functions 期望值函数的维塔利变异误差边界
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2024-08-06 DOI: 10.1016/j.orl.2024.107157
Alban Kryeziu, Ward Romeijnders, Evrim Ursavas
{"title":"Vitali variation error bounds for expected value functions","authors":"Alban Kryeziu,&nbsp;Ward Romeijnders,&nbsp;Evrim Ursavas","doi":"10.1016/j.orl.2024.107157","DOIUrl":"10.1016/j.orl.2024.107157","url":null,"abstract":"<div><p>We derive error bounds for two-dimensional expected value functions that depend on the Vitali variation of the joint probability density function of the corresponding random vector. Contrary to bounds from the literature, our bounds are not restricted to underlying functions that are one-dimensional and periodic. In our proof, we first derive the bounds in a discrete setting, which requires us to characterize the extreme points of the set of all matrices that have zero-sum rows and columns and have an <span><math><msub><mrow><mi>L</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>-norm bounded by one. This result may be of independent interest.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"56 ","pages":"Article 107157"},"PeriodicalIF":0.8,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167637724000932/pdfft?md5=5492f99c475f8d0118ba920e1fac4d6d&pid=1-s2.0-S0167637724000932-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141963657","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学术官方微信