A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem.
Martin E. DyerAlan M. FriezeRavi KannanAjai KapoorLjubomir PerkovicUmesh V. VaziraniPublished in: Comb. Probab. Comput. (1993)
Keyphrases
- multidimensional knapsack problem
- computational complexity
- optimal solution
- dynamic programming
- linear programming
- convergence rate
- learning algorithm
- optimization algorithm
- cost function
- solution quality
- benchmark problems
- knapsack problem
- computational intelligence
- search space
- np hard
- particle swarm optimization
- simulated annealing
- combinatorial optimization
- special case
- constrained optimization
- evolutionary strategy
- objective function