Mindmap
Network Models
Inhalt der Mindmap
Network Models
Shortest Path
- Dijkstra's Algorithm
Maximum Flow
- Linear Programing
- Ford-Fulkerson
Minimum Spanning Tree
Minimum Cost Flow
Assignment problem
Transportation problem
Circulation problem
Convex cost flow problems
Generalized flow problems
Multi-commodity flow problems
Matching problems
Informationen
- Beschreibung
- Mindmap am Network Models, erstellt von almouhanna am 10/06/2014.
- Erstellt von
- almouhanna
- Aufrufe
- 18
- Bewertung