Transcription of Lecture 16 Network Models: Minimal Spanning Tree
{{id}} {{{paragraph}}}
Example: marketing
Lecture 16 Network Models: Minimal Spanning Tree
Lecture 16 Network Models: Minimal Spanning TreeOctober 16, 2009 Lecture 16 Outline Network Models Minimal Spanning tree Problem - TODAY Shortest Route Problem Maximal-flow ProblemOperations research Methods1 Lecture 16 Bridges of K onigsbergThe city of K onigsberg in Prussia was established in can see the map of Prussia and the city onigsberg was set on the banks of Pregel River, and it included two largeislands which were connected to each other and the mainland by sevenbridges. The inhabitants of the city wanted to decide whether it is possibleto follow a path that crosses each bridge exactly once and returns to thestarting pointThe problem became know as the Seven Bridges of K research Methods2 Lecture 16 The Seven Bridges of K onigsbergOperations research Methods3 Lecture 16In 1736, Euler solved the problemshowing that such a path does notexist.
Lecture 16 Outline • Network Models • Minimal Spanning Tree Problem - TODAY • Shortest Route Problem • Maximal-flow Problem Operations Research Methods 1
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
Related search queries
Operations Research, IE316, IE316 Lecture 7, Lecture, Notes, Introduction to Operations Research Economics, Lecture Notes, With GNU Linear Programming Kit, Operations Research with GNU Linear Programming Kit, LECTURE NOTES ON OPERATIONS RESEARCH, Operations Research Lecture 6: Integer Programming, Operations Research Lecture 6: Integer Programming Notes, Operations Research Lecture, Linear Programming Notes, Operations, Game Theory Lecture Notes, Game Theory