Lecture15 - Graphs and Network Flows IE411 Lecture 15 Dr...

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

Graphs and Network Flows IE411 Lecture 15 Dr. Ted Ralphs
Image of page 1

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

IE411 Lecture 15 1 Preflow-Push Algorithms First developed by A. V. Goldberg in 1985. Best preflow-push algorithms outperform best augmenting path algorithms in theory and in practice. Push flows on individual arcs instead of augmenting paths. Do not satisfy mass balance constraints at intermediate stages. Work towards feasibility . Can be seen as a generalization of SAP (SAP is a special case).
Image of page 2
IE411 Lecture 15 2 Definitions Distance Labels Valid distance labels d with respect to a flow x satisfy d ( t ) = 0 and d ( i ) d ( j ) + 1 ( i, j ) G ( x ) Admissible Arc An arc ( i, j ) G ( x ) is admissible if d ( i ) = d ( j ) + 1 Preflow Preflow x in a network is defined as one which 1. Satisfies the capacity constraints 0 x ij u ij ( i, j ) 2. Has incoming flow at any node other than the source at least as large as outgoing flow X j :( j,i ) A x ji - X j :( i,j ) A x ij 0 i N - { s }
Image of page 3

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

IE411 Lecture 15 3 Definitions (con’t) Excess Excess of a node i , denoted e ( i ) , is defined with respect to a flow x e ( i ) = X j :( j,i ) A x ji - X j :( i,j ) A x ij Active Node A node i = t is called active if e ( i ) > 0
Image of page 4
IE411 Lecture 15 4 Basic Idea of Preflow-Push Algorithm
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, Record label, preflow-push algorithm, generic preflow-push algorithm

{[ 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