A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time.
Carolin RehsFrank GurskiPublished in: OR (2017)
Keyphrases
- knapsack problem
- randomly generated test instances
- continuous relaxation
- combinatorial optimization problems
- test problems
- greedy algorithm
- special case
- optimization problems
- linear programming relaxation
- optimal solution
- dynamic programming
- exact algorithms
- greedy algorithms
- bicriteria
- np hard problems
- machine learning
- production planning
- computational complexity