Skip to content

Combinatorial Optimization and Graph Algorithms in Julia

License

Notifications You must be signed in to change notification settings

dileep-kishore/CombOpt.jl

Repository files navigation

CombOpt.jl

Build Status stability-wip

Combinatorial Optimization and Graph Algorithms in Julia

Algorithms

  1. Shortest paths - Dijkstra's, Bellman Ford
  2. Max flow - Edmond Karp, Successive Shortest Paths
  3. Assignment - Auction
  4. Matching
  5. Minimum spanning tree
  6. Knapsack
  7. Vertex cover and Set cover
  8. Scheduling