tion algorithm  knapsack problem  maximum clique problem  minimum spanning tree problem  shortest path problem  traveling salesman problem  solution approaches  approximation algorithms  constructive heuristics  dynamic programming  genetic algorithms  greedy algorithm  greedy randomized adaptive search procedures  heuristics  integer programming  local search  metaheuristics  multistart  polynomially solvable special cases  pseudo-polynomial algorithms  semi-greedy algorithms  simulated annealing  tabu search  