The polynomial robust knapsack problem

DOI10.1016/J.EJOR.2022.06.029MaRDI QIDQ2103045zbMATH OpenOpenAlexFDO

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)

Recommendations

• Complexity results and exact algorithms for robust knapsack problems
• Exact solution of the robust knapsack problem
• The lexicographic \(\alpha \)-robust knapsack problem
• On the robust knapsack problem
• Computing knapsack solutions with cardinality robustness

Cites work

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

Cited in

(3)

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

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)