Complexity results and exact algorithms for robust knapsack problems
From MaRDI portal
Publication:2247901
Recommendations
- On the robust knapsack problem
- Exact solution of the robust knapsack problem
- Computing knapsack solutions with cardinality robustness
- Computing knapsack solutions with cardinality robustness
- The robust knapsack problem with queries
- The lexicographic \(\alpha \)-robust knapsack problem
- Exact methods for the knapsack problem and its generalizations
- The polynomial robust knapsack problem
- Robust efficiency measures for linear knapsack problem variants
- An exact algorithm for large multiple knapsack problems
Cites work
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
- A note on the max-min 0-1 knapsack problem
- A robust approach to the chance-constrained 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
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 2038886 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Min-max regret robust optimization approach on interval data uncertainty
- On the complexity of a class of combinatorial optimization problems with uncertainty
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization
- The dynamic and stochastic knapsack problem
- The lexicographic \(\alpha \)-robust knapsack problem
- The minmax multidimensional knapsack problem with application to a chance‐constrained problem
- The Price of Robustness
- The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
- Where are the hard knapsack problems?
Cited in
(27)- Robust combinatorial optimization with knapsack uncertainty
- The multi-band robust knapsack problem -- a dynamic programming approach
- Computing knapsack solutions with cardinality robustness
- A two-stage robust model for a reliable p-center facility location problem
- The polynomial robust knapsack problem
- Complexity results and exact algorithms for robust knapsack problems
- A note on upper bounds to the robust knapsack problem with discrete scenarios
- Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
- Robustness concepts for knapsack and network design problems under data uncertainty
- Robust optimization approach for a chance-constrained binary knapsack problem
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- 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
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
- scientific article; zbMATH DE number 1408349 (Why is no real title available?)
- Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
- Optimal genetic screening for cystic fibrosis
- On the robust knapsack problem
- Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem
- Comparative analysis of linear programming relaxations for the robust knapsack problem
- Approaches for biobjective integer linear robust optimization
- Recoverable robust knapsacks: the discrete scenario case
This page was built for publication: Complexity results and exact algorithms for robust knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2247901)
