Complexity results and exact algorithms for robust knapsack problems
From MaRDI portal
Publication:2247901
DOI10.1007/s10957-013-0319-3zbMath1291.90209OpenAlexW1988397112MaRDI QIDQ2247901
Roel Leus, Fabrice Talla Nobibon
Publication date: 30 June 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://orbi.ulg.ac.be/handle/2268/96726
Related Items (7)
Robust optimization approach for a chance-constrained binary knapsack problem ⋮ Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem ⋮ A two-stage robust model for a reliable \(p\)-center facility location problem ⋮ Complexity results and exact algorithms for robust knapsack problems ⋮ Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty ⋮ The polynomial robust knapsack problem ⋮ Optimal Genetic Screening for Cystic Fibrosis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Min-max regret robust optimization approach on interval data uncertainty
- A robust approach to the chance-constrained knapsack problem
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
- A note on the max-min 0-1 knapsack problem
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- Where are the hard knapsack problems?
- Complexity results and exact algorithms for robust knapsack problems
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
- Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
- The Dynamic and Stochastic Knapsack Problem
- The lexicographic α-robust knapsack problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
- The Price of Robustness
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
- The minmax multidimensional knapsack problem with application to a chance‐constrained problem
- On the complexity of a class of combinatorial optimization problems with uncertainty
This page was built for publication: Complexity results and exact algorithms for robust knapsack problems
