Submission for Discrete Optimization (Coursera)

0. Knapsack

Use DFS can solve with all 10s

1. Graph Coloring

• Heuristic. (Can pass the assignment, but not all 10s)
  • Consider the degree of nodes
  • Consider possible coloring options for nodes
• Backtracking, for dense graph, it takes too long time to get a solution.
• Local search with designed objective