The polynomial robust knapsack problem

DOI10.1016/J.EJOR.2022.06.029OpenAlexW4283264203MaRDI QIDQ2103045FDOQ2103045

Authors: Alessandro Baldo, Matteo Boffa, Lorenzo Cascioli, Edoardo Fadda, Chiara Lanza, Arianna Ravera 

Publication date: 12 December 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.06.029

zbMATH Keywords

heuristicsmachine learninggenetic algorithmrobust knapsack problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• The quadratic knapsack problem -- a survey
• The Price of Robustness
• Robust solutions of linear programming problems contaminated with uncertain data
• Quadratic knapsack problems
• Complexity results and exact algorithms for robust knapsack problems
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
• Exact solution of the robust knapsack problem
• Approximation of min-max and min-max regret versions of some combinatorial optimization problems
• Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
• Solution of large quadratic knapsack problems through aggressive reduction
• Linear programming for the \(0-1\) quadratic knapsack problem
• Title not available (Why is that?)
• A new upper bound for the 0-1 quadratic knapsack problem
• Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
• Title not available (Why is that?)

Cited In (3)

• Math‐based reinforcement learning for the adaptive budgeted influence maximization problem
• Complexity results and exact algorithms for robust knapsack problems
• A machine learning optimization approach for last-mile delivery and third-party logistics

This page was built for publication: The polynomial robust knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103045)