NOintro - ESI6417 Introduction Page 1 Introduction Four...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
ESI6417 Introduction Page 1 Introduction Four problems in Network Flows and Graphs: (AMO = Ahuja, Magnanti, and Orlin’s Network Flows) 1) Minimum Cost Flow Problem (AMO: Chapters 9 and 11.) 2) Shortest Path Problem (AMO: Chapter 4 and 5.) 3) Maximum Flow Problem (AMO: Chapter 6.) 4) Minimum Spanning Tree Problem (AMO: Chapter 13.) What is a network or graph? ± In operations research, it is more common to use the term ‘network’. In mathematics, the term ‘graph’ is more common. ± A network is a collection of nodes, some of which are connected by arcs. Arcs may or may not have a direction. Arcs without any direction are called undirected arcs . Otherwise, they are directed arcs . ± Note: In graph theory, node = vertex (nodes = vertices) and arcs = edges.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
ESI6417 Introduction Page 2 Example of networks City maps: nodes = road intersections, arcs = road segments between intersections, flow on the network = cars on road segments. State maps: nodes = cities, arcs = highways between cities, and flow = cars on
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 5

NOintro - ESI6417 Introduction Page 1 Introduction Four...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online