.png){kind=icon}
返回
The polynomial robust knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2022.06.029.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces a new optimization problem, namely the Polynomial Robust Knapsack Problem. It generalises the Robust Knapsack formulation to encompass possible relations between subsets of items having every possible cardinality. This allows to better describe the utility function for the decision maker, at the price of increasing the complexity of the problem. Thus, in order to solve realistic instances in a reasonable amount of time, two heuristics are proposed. The first one applies machine learning tech-niques in order to quickly select the majority of the items, while the second makes use of genetic algo-rithms to solve the problem. A set of simulation examples is finally presented to show the effectiveness of the proposed approaches.(c) 2022 Elsevier B.V. All rights reserved.
Keyword:
Heuristics
Robust knapsack problem
Genetic algorithm
Machine learning
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Transformation of organic rhizodepositions by rhizosphere bacteria and its influence on the availability of tertiary calcium phosphate.根际细菌对有机根际沉积的转化及其对叔磷酸钙有效性的影响。.png)
IF0
PREAI
分享收藏Approximation of min-max and min-max regret versions of some combinatorial optimization problems某些组合优化问题的min-max和min-max后悔版本的逼近
OAAI
OAAI分享收藏Simulation and performance evaluation of energy efficient MAC protocols for wireless sensor networks
PREAI
分享收藏
查看更多内容