Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem |
scientific article |
Statements
Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (English)
0 references
25 January 2016
0 references
robust optimization
0 references
knapsack problem
0 references
interval \(\min\)-\(\max\) regret
0 references
local search
0 references
Lagrangian relaxation
0 references
branch and cut
0 references
0 references
