Published: 01 Jan 2023, Last Modified: 14 May 2025Eur. J. Oper. Res. 2023EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract:Highlights•Mathematical formulation of the polynomial robust knapsack problem.•Development of a machine learning based heuristic.•Development of a genetic algorithm based heuristic.•Computational studies on heuristics.