Keyphrases
- np hard
- optimal solution
- np complete
- approximation algorithms
- traveling salesman problem
- linear programming
- lower bound
- special case
- closely related
- minimum cost
- np hardness
- worst case
- constraint satisfaction problems
- scheduling problem
- knapsack problem
- travelling salesman
- integer programming
- search space
- greedy heuristic
- decision problems
- branch and bound algorithm
- linear program
- computational complexity
- genetic algorithm
- lagrangian relaxation
- dynamic programming
- computationally hard
- remains np hard
- set cover
- computationally challenging