Lecture10 - Graphs and Network Flows ISE 411 Lecture 10 Dr...

Info icon This preview shows pages 1–6. Sign up to view the full content.

Graphs and Network Flows ISE 411 Lecture 10 Dr. Ted Ralphs
Image of page 1

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

ISE 411 Lecture 10 1 References for Today’s Lecture Required reading Sections 21.3 References AMO Chapter 5 CLRS Chapter 25
Image of page 2
ISE 411 Lecture 10 2 Shortest Path Algorithms Special structure easy! Special topology : Reaching Algorithm Special cost structure : Dijkstra’s Algorithm General network with negative cycles much harder! Identify a negative cycle if one exists OR Solve the problem if no negative cycle exists
Image of page 3

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

ISE 411 Lecture 10 3 General Label-Correcting Algorithms Maintain a distance label d ( j ) for all nodes j N If d ( j ) is infinite, the algorithm has not found a path joining the source node to node j . If d ( j ) is finite, it is the distance from the source node to that node along some path (upper bound). No label is permanent until the algorithm terminates.
Image of page 4
ISE 411 Lecture 10 4 Optimality Conditions Theorem 1. [5.1] For every node j N , let d ( j ) denote the length of
Image of page 5

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

Image of page 6
This is the end of the preview. Sign up to access the rest of the document.
  • Spring '14
  • TedRalphs
  • Graph Theory, Shortest path problem, shortest path, shortest path distances, Dr. Ted Ralphs

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern