Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem.
Mhand HifiHedi M'HallaSlim SadfiPublished in: J. Comb. Optim. (2005)
Keyphrases
- knapsack problem
- maximum profit
- binary variables
- combinatorial optimization problems
- optimal solution
- test problems
- exact algorithms
- optimization problems
- dynamic programming
- multidimensional knapsack problem
- linear programming relaxation
- np hard
- production planning
- np hard problems
- greedy algorithm
- cutting plane
- sensitivity analysis
- greedy heuristic
- bicriteria
- decision variables
- continuous relaxation
- search algorithm
- heuristic solution
- multiple objectives
- implicit enumeration
- integer programming
- machine learning