Hybrid rounding techniques for knapsack problems.
Monaldo MastrolilliMarcus HutterPublished in: Discret. Appl. Math. (2006)
Keyphrases
- worst case
- knapsack problem
- np hard
- linear programming relaxation
- approximation algorithms
- greedy algorithm
- lower bound
- exact algorithms
- linear programming
- optimal solution
- combinatorial optimization problems
- test problems
- optimization problems
- np hard problems
- branch and bound algorithm
- dynamic programming
- special case
- production planning
- scheduling problem
- binary variables
- integer programming
- maximum profit
- bicriteria
- optimization algorithm
- hybrid learning
- feasible solution
- continuous relaxation
- cutting plane
- column generation
- evolutionary algorithm
- branch and bound