Coping with NP-Completeness
Given a problem appears to be hard what do you do?
- Try to find a good algorithm for it.
- Try to show its decision version is NP-complete or NP-hard.
- Failing both, the problem probably is a hard one.
- For a hard problem there are many things to try.
- Branch-and-bound algorithm - for exact solution
- Approximate algorithm - heuristic