The polynomial robust knapsack problem
From MaRDI portal
Publication:2103045
DOI10.1016/j.ejor.2022.06.029OpenAlexW4283264203MaRDI QIDQ2103045
Edoardo Fadda, Chiara Lanza, Matteo Boffa, Lorenzo Cascioli, Alessandro Baldo, 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
Related Items (2)
A machine learning optimization approach for last-mile delivery and third-party logistics ⋮ Math‐based reinforcement learning for the adaptive budgeted influence maximization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Exact solution of the robust knapsack problem
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- The quadratic knapsack problem -- a survey
- Linear programming for the \(0-1\) quadratic knapsack problem
- Robust solutions of linear programming problems contaminated with uncertain data
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
- A new upper bound for the 0-1 quadratic knapsack problem
- Complexity results and exact algorithms for robust knapsack problems
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
- Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
- The Price of Robustness
- Quadratic knapsack problems
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
This page was built for publication: The polynomial robust knapsack problem
