README.md

Learn Optimization

Assignment

1. Assignment on Optimization Solver

Bin Packing

1. Bin Packing on Optimization Solver

Vehicle Routing Problem

VRPTW

1. Branch and Price
2. ALNS

Dynamic Programming

1. TSP
2. Dynamic Programming on Leetcode

Graph Theory

Shortest Path

1. Single Source Shortest Path
   1. SSSP on Directed Acycle Graph
      1. Shortest Longest Path on DAG
   2. Dijkstra
      1. Simple Dijkstra Algorithm
      2. Lazy Dijkstra Algorithm
      3. Stop Early
   3. Bellman Ford Algorithm
      1. BF Algorithm
2. All Pairs Shortest Path
   1. Floyd-Warshall

Network Flow

1. Ford-Fulkerson Method
2. Edmonds-Karp Algorithm
3. Dinic Algorithm
4. Capacity Scaling

Topological Sort

1. Topological Sort

Connected Component

1. Minimum Spanning Tree
   1. Prim's MST Algorithm
2. Bridges and Articulation Points
   1. Low Link
   2. Articulate Points
3. Strongly Connected Component
   1. Tarjan's Algorithm

Traveling Salesman Problem

1. Dynamic Programming
   1. Simple Dynamic Programming
   2. Parallel Dynamic Programming
2. Integer Programming
   1. MTZ
   2. Subtour Elimination
   3. Subtour Elimination by Cplex Callback

Eulerian Path

1. Eulerian Path on Directed Graph

Artificial Neural Network

1. DIY ANN

Evolution Algorithm

1. Genetic Algorithm

Reinforcement Learning

Tabular Method

1. SARSA
2. Q Learning