Lifting cover inequalities for the robust knapsack problem

IF 0.8 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Youngjoo Roh , Junyoung Kim , Kyungsik Lee
{"title":"Lifting cover inequalities for the robust knapsack problem","authors":"Youngjoo Roh ,&nbsp;Junyoung Kim ,&nbsp;Kyungsik Lee","doi":"10.1016/j.orl.2025.107301","DOIUrl":null,"url":null,"abstract":"<div><div>Robust cover inequalities are well-known valid inequalities for the robust knapsack problem (RKP). To strengthen them, we use lifting, which involves solving lifting problems—special cases of the RKP. We propose a novel lifting method that leverages upper bounds for lifting problems. First, we introduce a strong, efficiently computable, and quality-guaranteed upper bound for the RKP based on the decomposition property of its solution set. We then devise an efficient lifting method by applying the proposed upper bound to lifting problems.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107301"},"PeriodicalIF":0.8000,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637725000628","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Robust cover inequalities are well-known valid inequalities for the robust knapsack problem (RKP). To strengthen them, we use lifting, which involves solving lifting problems—special cases of the RKP. We propose a novel lifting method that leverages upper bounds for lifting problems. First, we introduce a strong, efficiently computable, and quality-guaranteed upper bound for the RKP based on the decomposition property of its solution set. We then devise an efficient lifting method by applying the proposed upper bound to lifting problems.
鲁棒背包问题的提盖不等式
鲁棒覆盖不等式是鲁棒背包问题(RKP)中众所周知的有效不等式。为了加强它们,我们使用举重,这涉及到解决举重问题- RKP的特殊情况。我们提出了一种新的提升方法,利用上界来解决提升问题。首先,我们基于RKP解集的分解性质,引入了一个强的、可高效计算的、质量保证的RKP上界。然后,我们将提出的上界应用于提升问题,设计了一种有效的提升方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Operations Research Letters
Operations Research Letters 管理科学-运筹学与管理科学
CiteScore
2.10
自引率
9.10%
发文量
111
审稿时长
83 days
期刊介绍: Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信