Hybrid Rounding Techniques for Knapsack Problems
Monaldo MastrolilliMarcus HutterPublished in: CoRR (2003)
Keyphrases
- knapsack problem
- linear programming relaxation
- combinatorial optimization problems
- test problems
- optimal solution
- exact algorithms
- dynamic programming
- linear programming
- lower bound
- np hard
- optimization problems
- np hard problems
- production planning
- greedy algorithm
- implicit enumeration
- approximation algorithms
- bicriteria
- mixed integer
- cutting plane
- integer programming
- mixed integer programming
- integer program
- feasible solution
- binary variables
- objective function
- neural network