Knapsack problems: A parameterized point of view.
Frank GurskiCarolin RehsJochen RethmannPublished in: Theor. Comput. Sci. (2019)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimization problems
- dynamic programming
- optimal solution
- test problems
- np hard
- linear programming relaxation
- production planning
- bicriteria
- exact algorithms
- greedy algorithm
- continuous relaxation
- neural network
- np hard problems
- evolutionary algorithm
- scheduling problem
- cutting plane
- branch and bound algorithm
- branch and bound
- computational efficiency
- implicit enumeration
- linear programming
- randomly generated test instances