Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems.
Monaldo MastrolilliPublished in: FCT (2001)
Keyphrases
- knapsack problem
- linear programming relaxation
- combinatorial optimization problems
- dynamic programming
- optimal solution
- optimization problems
- test problems
- linear programming
- np hard problems
- np hard
- bicriteria
- greedy algorithm
- integer programming
- machine learning
- binary variables
- lower bound
- neural network
- geometric constraints
- approximation algorithms
- floating point
- production planning
- exact algorithms
- search space
- objective function
- arithmetic operations
- continuous relaxation