A note on upper bounds to the robust knapsack problem with discrete scenarios
From MaRDI portal
Publication:2259050
DOI10.1007/s10479-014-1618-2zbMath1306.90127OpenAlexW2094916490MaRDI QIDQ2259050
Publication date: 27 February 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1618-2
Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Robust optimization approach for a chance-constrained binary knapsack problem ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ On the recoverable robust traveling salesman problem ⋮ Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Exact solution of the robust knapsack problem
- Recoverable robust knapsacks: the discrete scenario case
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- A note on the max-min 0-1 knapsack problem
- Robust solutions of uncertain linear programs
- Robust discrete optimization and its applications
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
- Robust Convex Optimization
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- A New Algorithm for the 0-1 Knapsack Problem
- AN IMPROVED REDUCTION METHOD FOR THE ROBUST OPTIMIZATION OF THE ASSIGNMENT PROBLEM
- Discrete-Variable Extremum Problems
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: A note on upper bounds to the robust knapsack problem with discrete scenarios
