Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs