A polynomial-time algorithm for solving NP-hard problems in practice.
Xiaofei HuangPublished in: SIGACT News (2003)
Keyphrases
- np hard problems
- computational complexity
- cost function
- dynamic programming
- worst case
- np hard
- combinatorial search
- randomly generated
- similarity measure
- particle swarm optimization
- knapsack problem
- search strategy
- matching algorithm
- linear programming
- search space
- ant colony optimization
- np complete
- combinatorial optimization
- simulated annealing
- benchmark problems
- special case
- optimal solution