Sensitivity analysis of a greedy heuristic for knapsack problems.
Diptesh GhoshNilotpal ChakravartiGerard SierksmaPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- sensitivity analysis
- greedy heuristic
- knapsack problem
- combinatorial optimization problems
- optimal solution
- managerial insights
- dynamic programming
- greedy algorithm
- np hard
- optimization problems
- linear programming relaxation
- minimum weight
- exact algorithms
- variational inequalities
- test problems
- worst case analysis
- influence diagrams
- cutting plane
- production planning
- multiple objectives
- nsga ii
- linear programming
- bicriteria
- implicit enumeration
- simulated annealing
- maximum profit