.png){kind=icon}
Return
The polynomial robust knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2022.06.029.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Heuristics
Robust knapsack problem
Genetic algorithm
Machine learning
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveApproximation of min-max and min-max regret versions of some combinatorial optimization problems
OAAI
OAAIShareSaveSimulation and performance evaluation of energy efficient MAC protocols for wireless sensor networks
PREAI
ShareSaveShareSave
View more