On the robust knapsack problem
From MaRDI portal
Recommendations
- Exact solution of the robust knapsack problem
- Complexity results and exact algorithms for robust knapsack problems
- Computing knapsack solutions with cardinality robustness
- Computing knapsack solutions with cardinality robustness
- A note on upper bounds to the robust knapsack problem with discrete scenarios
Cited in
(30)- Robust combinatorial optimization with knapsack uncertainty
- Randomized strategies for cardinality robustness in the knapsack problem
- Knapsack with variable weights satisfying linear constraints
- The multi-band robust knapsack problem -- a dynamic programming approach
- Tolerance analysis for 0-1 knapsack problems
- Computing knapsack solutions with cardinality robustness
- Exact lexicographic scheduling and approximate rescheduling
- The polynomial robust knapsack problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Exact algorithms for the 0-1 time-bomb knapsack problem
- Complexity results and exact algorithms for robust knapsack problems
- A note on upper bounds to the robust knapsack problem with discrete scenarios
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
- Robust optimization approach for a chance-constrained binary knapsack problem
- Robust combinatorial optimization with variable cost uncertainty
- The lexicographic \(\alpha \)-robust knapsack problem
- Recoverable robust knapsacks: -scenarios
- Computing knapsack solutions with cardinality robustness
- Exact solution of the robust knapsack problem
- The robust knapsack problem with queries
- Constant-ratio approximation for robust bin packing with budgeted uncertainty
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- Randomized strategies for cardinality robustness in the knapsack problem
- Packing a knapsack of unknown capacity
- Deriving compact extended formulations via LP-based separation techniques
- Deriving compact extended formulations via LP-based separation techniques
- Comparative analysis of linear programming relaxations for the robust knapsack problem
- A branch and bound algorithm for robust binary optimization with budget uncertainty
- Model-based algorithms for the 0-1 time-bomb knapsack problem
- A nonparametric robust optimization approach for chance-constrained knapsack problem
This page was built for publication: On the robust knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408207)
