Exact solution of the robust knapsack problem
From MaRDI portal
Publication:336592
DOI10.1016/j.cor.2013.05.005zbMath1348.90549OpenAlexW2037342851WikidataQ42115190 ScholiaQ42115190MaRDI QIDQ336592
Paolo Serafini, Michele Monaci, Ulrich Pferschy
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.05.005
Related Items (26)
Robust optimization approach for a chance-constrained binary knapsack problem ⋮ Robust combinatorial optimization with variable cost uncertainty ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Robust Network Design with Uncertain Outsourcing Cost ⋮ Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms ⋮ The robust knapsack problem with queries ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ One-dimensional stock cutting resilient against singular random defects ⋮ Improved handling of uncertainty and robustness in set covering problems ⋮ Comparative analysis of linear programming relaxations for the robust knapsack problem ⋮ Deriving compact extended formulations via LP-based separation techniques ⋮ Lifting of probabilistic cover inequalities ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ 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 ⋮ Deriving compact extended formulations via LP-based separation techniques ⋮ A note on upper bounds to the robust knapsack problem with discrete scenarios ⋮ Public R\&D project portfolio selection problem with cancellations ⋮ Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study ⋮ Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity ⋮ A Dynamic Programming Approach for a Class of Robust Optimization Problems ⋮ A branch and price approach for the robust bandwidth packing problem with queuing delays ⋮ Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem ⋮ The polynomial robust knapsack problem ⋮ Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Uses Software
Cites Work
- Unnamed Item
- Recoverable robust knapsacks: the discrete scenario case
- A robust approach to the chance-constrained knapsack problem
- A new fully polynomial time approximation scheme for the Knapsack problem
- Robust discrete optimization and network flows
- Approximation algorithms for knapsack problems with cardinality constraints
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Where are the hard knapsack problems?
- Robust combinatorial optimization with variable budgeted uncertainty
- Dynamic programming revisited: Improving knapsack algorithms
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
- Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
- Theory and Applications of Robust Optimization
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- The Price of Robustness
- Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
This page was built for publication: Exact solution of the robust knapsack problem
