Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem.
Federico Della CroceUlrich PferschyRosario ScatamacchiaPublished in: CoRR (2017)
Keyphrases
- knapsack problem
- lp relaxation
- optimal solution
- approximation schemes
- dynamic programming algorithms
- dynamic programming
- combinatorial optimization problems
- optimization problems
- linear programming
- linear programming relaxation
- greedy algorithm
- linear program
- integer programming
- message passing
- exact algorithms
- cutting plane
- feasible solution
- network design problem
- integer program
- approximation algorithms
- np hard
- cost function
- numerical methods
- neural network
- solution quality
- global constraints
- search algorithm
- constraint satisfaction
- multistage
- valid inequalities
- active contours
- maximum likelihood
- state space