Techniques for Dealing with NP-complete Problems

• Exactly

  • backtracking , branch and bound

• Approximately

  • approximation algorithms with performance guarantees
  • using LP (e.g., randomized rounding)
  • local search, tabu search
  • simulated annealing
  • ….

• Change the problem.

Previous slide

Next slide

Back to first slide

View graphic version