"""
# Coping with NP-completeness

- Intelligent exhaustive search
    - Backtracking
    - Branch-and-bound
- Approximation algorithms
    - Vertex cover
    - Clustering
    - TSP
    - General TSP
    - Knapsack
    - The approximability hierarchy
- Local search heuristics
    - Traveling salesman, once more
    - Graph partitioning
    - Dealing with local optima
    - Randomization and restarts
    - Simulated annealing
"""
module Chapter9

end # module
