A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions.
Daniel StefankovicSantosh S. VempalaEric VigodaPublished in: SIAM J. Comput. (2012)
Keyphrases
- polynomial time approximation
- np hard
- optimal solution
- approximation algorithms
- error bounds
- knapsack problem
- feasible solution
- approximation guarantees
- vertex cover
- dynamic programming
- bin packing
- linear programming
- approximation schemes
- branch and bound algorithm
- identical machines
- minimum cost
- genetic algorithm
- tabu search
- orders of magnitude
- objective function