Operations Research - Transportation, Assignment, Dijkstra | VilaBoard
Solve transportation problems (NWC, Least Cost, Vogel), assignment (Hungarian) and shortest path (Dijkstra). OR tools online.
Features:- Transportation problem (NWC, Least Cost, Vogel)
- Assignment with Hungarian algorithm
- Dijkstra's shortest path
- Step-by-step solutions
How to use:- Choose the problem type
- Build the cost matrix
- Solve and review each step
VilaBoard - Home
ยท
Portugues