Unbounded knapsack problems with arithmetic weight sequences.
Vladimir G. DeinekoGerhard J. WoegingerPublished in: Eur. J. Oper. Res. (2011)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- test problems
- optimization problems
- dynamic programming
- linear programming relaxation
- np hard
- greedy algorithm
- exact algorithms
- np hard problems
- bicriteria
- cutting plane
- hidden markov models
- production planning
- lower bound
- evolutionary algorithm
- binary variables
- continuous relaxation
- sequence alignment
- learning algorithm
- sequential patterns
- multi objective
- arithmetic operations
- cost function
- maximum profit