The polynomial robust knapsack problem
type: Item
instance of: scholarly article
title: The polynomial robust knapsack problem
author: Alessandro Baldo
author: Matteo Boffa
author: Lorenzo Cascioli
author: Edoardo Fadda
author: Chiara Lanza
author: Arianna Ravera
published in: European Journal of Operational Research
publication date: 2022-12-12T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7632176
zbMATH Keywords: heuristics
zbMATH Keywords: robust knapsack problem
zbMATH Keywords: genetic algorithm
zbMATH Keywords: machine learning
MaRDI profile type: Publication
full work available at URL: j.ejor.2022.06.029
OpenAlex ID: W4283264203
cites work: Approximation of min-max and min-max regret versions of some combinatorial optimization problems
cites work: Robust solutions of linear programming problems contaminated with uncertain data
cites work: The Price of Robustness
cites work: Linear programming for the \(0-1\) quadratic knapsack problem
cites work: A new upper bound for the 0-1 quadratic knapsack problem
cites work: Q3835301
cites work: Quadratic knapsack problems
cites work: Q4550768
cites work: Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
cites work: Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
cites work: Exact solution of the robust knapsack problem
cites work: The quadratic knapsack problem -- a survey
cites work: Solution of large quadratic knapsack problems through aggressive reduction
cites work: Complexity results and exact algorithms for robust knapsack problems
cites work: Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
DOI: 10.1016/J.EJOR.2022.06.029
description: scientific article; zbMATH DE number 7632176