Exact solution of the robust knapsack problem
From MaRDI portal
(Redirected from Publication:336592)
Recommendations
Cites work
- A new fully polynomial time approximation scheme for the Knapsack problem
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
- A robust approach to the chance-constrained knapsack problem
- Approximation algorithms for knapsack problems with cardinality constraints
- Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Dynamic programming revisited: Improving knapsack algorithms
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Recoverable robust knapsacks: the discrete scenario case
- Robust combinatorial optimization with variable budgeted uncertainty
- Robust discrete optimization and network flows
- Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
- The Price of Robustness
- Theory and applications of robust optimization
- Where are the hard knapsack problems?
Cited in
(37)- Improved handling of uncertainty and robustness in set covering problems
- Lifting of probabilistic cover inequalities
- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
- The multi-band robust knapsack problem -- a dynamic programming approach
- Tolerance analysis for 0-1 knapsack problems
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
- Public R\&D project portfolio selection problem with cancellations
- A branch and price approach for the robust bandwidth packing problem with queuing delays
- The polynomial robust knapsack problem
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
- 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
- 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
- A dynamic programming approach for a class of robust optimization problems
- Robust optimization approach for a chance-constrained binary knapsack problem
- Robust combinatorial optimization with variable cost uncertainty
- The robust knapsack problem with queries
- Robust network design with uncertain outsourcing cost
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- Exact algorithms and evolutionary algorithms for randomized time-varying knapsack problem
- On the robust knapsack problem
- Deriving compact extended formulations via LP-based separation techniques
- Deriving compact extended formulations via LP-based separation techniques
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
- One-dimensional stock cutting resilient against singular random defects
- Comparative analysis of linear programming relaxations for the robust knapsack problem
- A new sequential lifting of robust cover inequalities
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
- Benchmarking problems for robust discrete optimization
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Online simple knapsack with bounded predictions
- Lifting cover inequalities for the robust knapsack problem
- A robust approach to the chance-constrained knapsack problem
This page was built for publication: Exact solution of the robust knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336592)
