Ricerca Operativa — Interactive Companions

Interactive visualizations for the Ricerca Operativa course at the University of Udine.

Each notebook lets you step through classic Operations Research algorithms with sliders and custom inputs — all running directly in your browser via Pyodide, no installation required.

Notebooks

Linear Programming & Simplex

  1. LP Graphical Method — Plot constraints, shade the feasible region, and slide the objective to the optimum
  2. Simplex Tableau — Step through pivot operations on the simplex tableau

Integer Programming

  1. Branch & Bound — Explore the B&B tree with LP relaxation bounds and pruning
  2. Cutting Planes — Watch the feasible region tighten as Gomory cuts are added

Graph Algorithms

  1. Graph Traversal — BFS and DFS with step-by-step node coloring
  2. Minimum Spanning Trees — Prim’s and Kruskal’s algorithms edge by edge
  3. Dijkstra’s Algorithm — Shortest path with distance relaxation steps

Network Optimization

  1. Network Flow — Augmenting paths, residual graphs, and min-cut visualization
  2. Matching — Augmenting paths on bipartite graphs