Generalized Knapsack Problems and Fixed Degree Separations.
Felipe CuckerMike ShubPublished in: Theor. Comput. Sci. (1996)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimization problems
- linear programming relaxation
- greedy algorithm
- optimal solution
- exact algorithms
- dynamic programming
- test problems
- continuous relaxation
- np hard
- binary variables
- bicriteria
- production planning
- np hard problems
- fixed number
- cutting plane
- machine learning
- linear program
- scheduling problem
- reinforcement learning