They were originally developed for network problem [Dantzig, Ford, Fulkerson 1956]

Size: px
Start display at page:

Download "They were originally developed for network problem [Dantzig, Ford, Fulkerson 1956]"

Transcription

1 6. Inroducion The primal-dual algorihmn Remark on he primal-dual algorihmn A primal-dual algorihmn for he hore pah problem A primal-dual algorihmn for he weighed maching problem (a kech) Inroducion - Background Primal-dual algorihm are baed on complemenary lackne. They were originally developed for nework problem [Danzig, Ford, Fulkeron 96] They provide a general mehod o derive "pecialized" algorihm for combinaorial opimizaion problem, exac and approximae. Baic idea Sar wih an LP in andard form (P) min z = c T x Ax = b! (w.o.l.g.) x! The aociaed dual LP i (D) max w = π T b π T A " c T π unrericed Complemenary lackne yield

2 6. Inroducion - x S P, π S D are opimal <=> π i (a T i x - b i ) = for all i (hi hold ince Ax = b) (c j - π T A j )x j = for all j (6.) So: (6.) = i he only condiion for opimaliy Primal-dual algorihm Given π S D, find x S P uch ha x and π fulfill (6.) We earch for uch an x S P olving an auxiliary problem, called he rericed primal (RP), deermined by he given dual feaible oluion π S D. If no uch x exi, we ue informaion from he dual (DRP) of he rericed primal (RP) in order o conruc a "beer" dual oluion π S D. We ierae hi proce unil we (hopefully) find an opimal pair x, π 6. Inroducion - primal problem P dual problem D RP DRP π x? π improving π Remark: hi i eenially a dual algorihm, ince we have a dual feaible oluion π in every ep and obain an opimal primal feaible oluion x only a erminaion. I i neverhele called primal-dual becaue of he role of he complemenary lackne condiion.

3 6. The primal-dual algorihmn 6- Conrucing a dual feaible ar oluion π All c j! => π = i dual feaible, a π T A " c T Some c j < Ue a rick: Inroduce anoher primal variable x n+! Inroduce anoher primal conrain x + x x n+ = b m+ wih b m+! n M (M from Lemma.) and c m+ = Lemma. => hi conrain doe no change S P The dual problem hen i max w = π T b + π m+ b m+ π T A j + π m+ " c j j =,...,n π m+ " π i unrericed, i =,...,m A feaible oluion of hi dual LP i given by 6. The primal-dual algorihmn 6- π i = i =,...,m π m+ = min j c j < (ince a lea one c j < ) => a dual feaible oluion can be conruced quie eaily (much impler han a primal wih he Two-Phaemehod) The Rericed Primal (RP) Aume ha we have a dual feaible oluion π of (D) To fulfill (6.), e J := { j π T A j = c j } We call J he e of admiible column (6.) => x S P i opimal <=> x j = for all j J So we are looking for an x wih # j! J A j x j = b x!, x j = for all j J Thi earch i a pure feaibiliy problem, which we will olve wih Phae I of he implex algorihm. The Phae I problem i called he Rericed Primal (RP):

4 6. The primal-dual algorihmn 6-!"#! $ " #$% $% # &'()* +, % #+$ #+ & $ % # $ - # # $ %. / / /. " $ +! ' +, $ + $ ' +, $ % #! ' # $ %. / / /. " () may delee hee x j We can olve (RP) wih he implex algorihm. (RP) earche for a feaible oluion of (P) wihou he column A j wih j J. The arificial variable define he iniial bai of (RP). If ξ op =, hen each arificial variable i and x i a feaible oluion of (RP) => x i an opimal oluion of (P) If ξ op >, hen here i no feaible oluion of (RP) => we inveigae he dual LP of (RP) The dual (DRP) of he rericed primal (DRP) read 6. The primal-dual algorihmn 6- max w = π T b (6.).. π T A j j J (6.) π i i =,..., m (6.) π i unrericed i =,..., m (6.) (DRP) Le π be an opimal oluion of (DRP) (i exi becaue of Srong Dualiy) Idea: combine π wih he original dual oluion π o π* := π + θπ (6.6) where θ i choen uch ha π* ay feaible in (D) and he dual objecive funcion of (D) ricly increae Conequence for he dual objecive funcion of (D): (π*) T b = π T b + θ(π ) T b = ξ op > a (RP) and (DRP) are a primal dual pair Hence θ > i required for a ric increae of he dual objecive funcion Conequence for dual feaibiliy in (D)

5 6. The primal-dual algorihmn 6- dual feaibiliy mean (π*) T A j = π T A j + θ(π ) T A j " c j for j =,..., n hi i no problem if (π ) T A j " (hi hold for all j J ince π S DRP ) There are cae (π ) T A j " for all j =,..., n => θ can be made arbirarily large => he dual objecive funcion of (D) i unbounded Theorem. => (P) ha no feaible oluion (π ) T A j > for ome j J Then we obain a conrain for θ:! T A j + "(! ) T A j! c j > We ummarize o θ c j π T A j (π ) T A j 6. The primal-dual algorihmn Theorem (Infeaibiliy of (P) in he primal-dual algorihm) If ξ op > in (RP) and (π ) T A j " for all j =,..., n w.r.. he opimal oluion π of (DRP), hen (P) ha no feaible oluion. Proof: clear from he above! 6. Theorem (Improvemen of he dual oluion in he primal-dual algorihm) If ξ op > in (RP) and (π ) T A j > for ome j J, hen!! "# $%&! " # " $ % & # '$ ( % & # # # '( '$ ( % & # ) ) $ '**+( i he large θ, uch ha π* := π + θπ i dual feaible. Then w* := (π*) T b = π T b + θ (π ) T b > w (= π T b) Proof: clear from he above! The primal-dual algorihm Algorihm (Primal-Dual)

6 6. The primal-dual algorihmn 6-7 Inpu Primal LP (P) in andard form Aociaed dual LP (D) wih feaible oluion π (poibly conruced by he above rick) Oupu A erminaion : an opimal oluion or a meage ha (P) ha no feaible oluion Terminaion can be guaraneed by ani-cycling rule Mehod repea Conruc (RP) by compuing J := { j π T A j = c j } a call Phae I wih co vecor ξ = # x i for (RP) if ξ op > hen call dual Simplex for (DRP) and ake he compued opimal oluion π if (π ) T A j " for all j =,..., n hen reurn "(P) ha no feaible oluion" ele compue θ according o (6.7) 6. The primal-dual algorihmn 6-8 e π := π + θ π unil ξ op = reurn oluion x of (RP)

7 6. Remark on he primal-dual algorihmn 7- () Rear: The baic opimal oluion of he previou (RP) i a baic feaible oluion for he new (RP) 6. Theorem (Keeping admiible baic column) Every admiible column of he opimal bai of (RP) remain admiible a he ar of he nex ieraion of he primal-dual algorihm Proof Le A j be an admiible column of he opimal bai of (RP) Definiion of admiible column => A j i a column of A, i.e., doe no belong o an arificial variable reduced co of a baic column i, π i a dual opimal oluion of (RP)! " #! " "! "! $# % $ % " "!! $# % $ % "!! " " # $ # $ Then (π*) T A j = π T A j + θ (π ) T A j = π T A j + = π T A j = c j ince A j i an admiible column w.r.. π => A j remain admiible w.r.. π*! 6. Remark on he primal-dual algorihmn 7- An opimal bai of (RP) i compoed of admiible column => ay admiible becaue of Theorem 6. column of arificial variable => ay in he new (RP) => () () (RP) can be olved wih he revied implex algorihm hi follow from Theorem 6.. We only need o updae he e J for he non-baic column () Terminaion can be achieved by ani-cycling rule 6. Theorem (Terminaion of he primal-dual algorihm) The primal-dual algorihm olve (P) in finiely many ep Proof a a Inerpre (RP) a a equence of pivo of variable x,..., xm, x,..., x n (poible ince x j = for j J and hu can be inerpreed a a non-baic variable) => (RP) ravere a equence of baic feaible oluion of (I A) Claim: The objecive funcion decreae monoonically along ha equence (no necearily ricly)

8 6. Remark on he primal-dual algorihmn 7- hi i clear wihin he repea-loop, becaue hen he algorihm i ju he ordinary (revied) implex algorihm. conider now a new enry ino he repea-loop => we compue θ Le r be he index a which he minimum i aained in he compuaion of θ Sub-Claim: column r i admiible and ha negaive reduced co in he new (RP)!! " " # $ #! " # $ $ % %!! " " # $ #! " # $ $ & $!! " # $!! " " # $ "!! " " # $ # & $ => A r i admiible w.r.. π* => r admiible in he new (RP) in he new (RP) column r ha reduced co (ee Proof of Theorem 6. in hi ubecion) - (π ) T A r < a (π ) T A r > by definiion of θ Sub-Claim => when enering he repea-loop, we may chooe column r a pivo column in he ene of he ordinary implex algorihm wih monoonically decreaing co Claim => adaping he lexicographic rule o he equence of baic oluion of (I A) yield erminaion! 6. A primal-dual algorihmn for he hore pah problem 8- Deriving (P), (D), (RP), (DRP) We conider he formulaion of (SP) from Secion. (P) min c T f Af = b (A = verex-edge-incidence marix) f! where he row of verex i deleed The dual LP i (D) max π - π π i - π j " c ij for all edge (i, j) E(G) π i unrericed π = (correpond o deleed row ) The e of admiible column i IJ = { (i,j) E π i - π j = c ij }

9 6. A primal-dual algorihmn for he hore pah problem 8- (RP) hen i min ξ = # i=,...,n- x i a x a + Af =... row! for all edge (i,j) E(G) = for all edge (i,j) IJ a x i! for i =,..., n- The aociaed dual (DRP) i max w = π π i - π j " for all edge (i, j) IJ π i " for i =,..., n- (obained from he column of he x i a ) π = Inerpreaion of he primal-dual algorihm 6. A primal-dual algorihmn for he hore pah problem 8- () ξ op = in (RP) <=> here i a pah from o uing only edge from IJ. Each uch pah i an opimal oluion of (P), i.e., a hore,-pah Proof "=>" Le ξ op = => every baic opimal oluion of (RP) i an,-pah wih = for all edge (i,j) IJ => hi pah ue only edge from IJ. "<=" every,-pah conaining only edge from IJ i feaible in (RP) and ha ξ = => hi pah i opimal for (P) becaue of he primal-dual mehod (i aifie complemenary lackne)! () If here i no pah from o wih edge only from IJ, hen π wih π i := i opimal for (DRP) Proof can be reached from i via edge from IJ or i = oherwie

10 6. A primal-dual algorihmn for he hore pah problem 8- π i feaible for (DRP) π i " and π = hold by definiion Aume ha π i - π j " i violaed for edge (a,b) IJ π ha only value and => π a = and π b = Definiion of π => can be reached from b via edge from IJ (a,b) IJ => can be reached from a via edge from IJ => π a =, a conradicion π i opimal for (DRP) The objecive funcion i max w = π Conrain π " => every π wih π = i opimal => π i opimal! () For ξ op > and π defined in () we obain θ = min { c ij - (π i - π j ) (i, j) IJ, π i - π j = } Proof Le ξ op > and π be defined a in (), o in paricular opimal for (DRP). (6.7) implie 6. A primal-dual algorihmn for he hore pah problem 8-!! " #$%! " #$ " % & ' #$ &% ' & ' #$ # &#( $' )*( &% ' & ' #$ + ( $ (π ) T A ij = π i - π j > <=> π i = and π j = => (π ) T A ij = π i - π j =! () The primal-dual algorihm reduce (SP) o a equence of reachabiliy problem Can be reached from i via edge from IJ? or., afer invering he orienaion of all edge, Which verice can be reached from via edge from IJ? Proof Follow from ()-()! 6. Example Inpu daa

11 6. A primal-dual algorihmn for he hore pah problem 8-6 c ij c ij! => π = i feaible in (D) Ieraion! IJ = Ø! θ = min { c ij - (π i - π j ) (i, j) IJ, π i - π j = } = for edge (,) => π* = π + θ π = (,...,) T + (,,,,,) T = (,,,,,) T Ieraion 6. A primal-dual algorihmn for he hore pah problem 8-7!! θ = min { - ( - ), - ( - ), - ( - ) } = for edge (,) => π* = π + θ π = (,,,,,) T + (,,,,,) T = (,,,,,) T Ieraion!! θ = min { - ( - ), - ( - ) } = for edge (,) and (,) => π* = π + θ π = (,,,,,) T + (,,,,,) T = (,,,,,) T Ieraion

12 6. A primal-dual algorihmn for he hore pah problem 8-8!! θ = min { - ( - ), - ( - ) } = for edge (,) => π* = π + θ π = (,,,,,) T + (,,,,,) T = (6,,,,,) T Ieraion π 6 opimum reached π = (6,,,,,) T i dual opimal = vecor of hore diance o Deailed inerpreaion of he differen ep () Define W a 6. A primal-dual algorihmn for he hore pah problem 8-9 W := { i V can be reached from i via edge from IJ } = { i V π i = } π i remain unchanged a oon a i W, ince π i = aferward () When an edge (i, j) ener IJ, i ay in IJ, becaue π i and π j change by he ame amoun => π i - π j ay he ame () i W => π i = lengh of a hore pah from i o (inducive proof) In every ieraion of he algorihm, one add hoe verice from V - W o W ha are cloe o (inducive Proof) Conequence The primal-dual algorihm for (SP) wih c! i eenially Dijkra' algorihm, a in he chord model in Secion.

13 9- Deriving (P), (D), (RP), (DRP) Primal LP (P) and dual LP (D) We conider he formulaion of he ranporaion problem from Secion. (P) min # i,j c ij.. # j = for all i (pick up upply from verex i) # i = b j for all j (deliver demand b j o verex j )! for all i, j wih (w.o.l.g.) # i = # j b j Inroduce dual variable, β j for he wo group of conrain β j # j = for all i # i = b j for all j The dual (D) hen i (D) max # i + # j b j β j.. + β j " c ij for all i, j, β j unconrained A feaible oluion of (D) i 9- = for all i β j = min i c ij for all j doe no require ha all c ij! ) Rericed primal (RP) The e of admiible column i IJ = { (i,j) E + β j = c ij } Rericed primal (RP) a min ξ = # i=,...,m+n x i a # j + x i = for i =,..., m a # i + x m+j = bj for j =,..., n! for all edge (i,j) IJ = for all edge (i,j) IJ a x i! for i =,..., m+n a We modify (RP) by ubiuing he arificial variable x i in he objecive funcion and obain (wih fij = for all edge (i,j) IJ)

14 9- ξ =! i +! j b j -! (i,j)! IJ conan => minimizing ξ <=> maximizing # (i,j)! IJ Deleing he arificial variable hen yield (becaue of x i a! ) (RP') max # (i,j)! IJ # j " for i =,..., m # i " b j for j =,..., n! for all edge (i,j) IJ = for all edge (i,j) IJ => (RP') correpond o a max-flow problem in he graph G of admiible edge 9- a! b a I! J a m!! b n = capaciie admiible edge The primal-dual algorihm yield: f i opimal in (P) <=> he maximum flow value fulfill v(f) = # i = # j b j The dual (DRP) of (RP) Inroduce dual variable u i, v j for he wo group of conrain a u i # j + x i = for i =,..., m v j # i + x m+j a = bj for j =,..., n The dual of (RP) i (DRP) max w = # i u i + # j b j v j..

15 9- u i + v j " for all (i,j) IJ u i, v j " u i, v j unrericed 6.6 Lemma (Opimal oluion of (DRP)) Le ξ op > in (RP) and le f be a maximum,-flow in G. Le I* " I be he e of verice ha can be reached from in G f (i.e. here i a flow augmening pah from o hee verice). Le J* " J be he e of verice ha can be reached from in G f (i.e. here i a flow augmening pah from o hee verice). Then := if i I* := - if i I* β j := - if j J* β j := if j J* i an opimal oluion of (DRP). Proof From ADM I we know ha X := {} # I* # J* i a cu of minimum capaciy of G, and ha every max-flow algorihm compue uch a cu. Hence he e I* and J* can be deermined efficienly. 9-6 We analyze hi cu of G I* no edge from I* o J-J* auraed edge - - J* auraed edge flow = on he edge from I-I* o J* () here i no edge (i,j) from I* o J-J* oherwie j J* becaue of he infinie capaciy of (i,j) () = for all edge (i,j) from I-I* o J* oherwie (j,i) i a backward edge in G f, implying i I* () edge (,i) from o I-I* are auraed oherwie i I* () he edge (j,) from J* o are auraed

16 9-7 oherwie here i a flow augmening,-pah () he flow value i v(f) = # i! I-I* + # j! J* b j ince: v(f) = ne ouflow ou of X = {} # I* # J* ino V(G) - X => () follow from () - () (A) and β j are feaible for (DRP) Show ha + β j " If + β j > => = and β j = => i I* and j J-J* => a conradicion o () (B) and β j are opimal for (DRP) The objecive funcion value for and β j i w = # i + # j b j β j = # i! I* - # i! I-I* - # j! J* b j + # j! J-J* b i Becaue of (DRP') and () ξ op = # i + # j b j - v(f) = # i + # j b j - ( # i! I-I* + # j! J* b j ) = w Weak dualiy => and β j are opimal! 9-8 Updaing he dual oluion Le and β j be dual oluion of (D) and le and β j be he opimal oluion of (DRP) If ξ op >, hen here are cae in he primal-dual algorihm (Theorem 6.) Cae : + β j " for all (i,j) IJ => (P) i infeaible by Theorem 6. hi canno happen a (P) ha a feaible oluion, e.g. = (/# k a k ) b j Cae : + β j > for ome (i,j) IJ So hi cae i he andard cae. (6.7) yield!! " #$%! " #$ " % & ' #$ &% ' & ' #$ # &#( $' )*( &% ' & ' #$ + ( $! "#$!! "# " $ " " % # $ " % % # # &"& #' '(& $ " % % # ) ( $! "#$!! "# " $ " " % # % # " & ' # ( $ We ummarize

17 Lemma (Updaing he dual oluion) Le ξ op > in (RP) and le f be a maximum,-flow in G. Le I* " I be he e of verice ha can be reached from in G f Le J* " J be he e of verice ha can be reached from in G f Then!! " #$%! " #$ " % # " & $ & # # ' ( $ ) $ and he new dual oluion i obained a * = + θ if i I* * = - θ if i I* β j * = β j - θ if j J* β j * = β j + θ if i J* Every opimal flow of he old (RP') ay feaible in he new (RP'). Proof The new dual oluion i obained a π* := π + θ π Hence he value of * and β j * follow from he value of θ and Lemma 6.6 I remain o how ha he opimal flow ay feaible. Thi follow already from Theorem 6., ince he 9- opimal flow i a baic feaible oluion of (RP'). We give a direc proof below. Claim: edge (i,j) wih poiive flow ay admiible in he new (RP) > => edge (i,j) i admiible in he old (RP) => + β j = c ij analyi of he cu of G (Proof of Lemma 6.6) => wo poible cae Cae : i I* and j J* => * + β j * = + θ + β j - θ = + β j = c ij Cae : i I-I* and j J-J* => * + β j * = - θ + β j + θ = + β j = c ij! Der primal-dual algorihm for he ranporaion problem Algorihm alpha-bea Inpu Inance of he ranporaion problem, i.e., number >, b j >, and c ij wih # i = # j b j Oupu A minimum co ranporaion plan Mehod

18 9- Deermine a feaible oluion of (D) by := for all i β j := min i c ij for all j repea conruc graph G of admiible edge from IJ := { (i,j) E + β j = c ij } compue a maximum,-flow f in G // warmar wih he flow from he previou ieraion i poible if v(f) < # i hen e I* := { i I here i a flow augmening,i-pah in G f } e J* := { j J here i a flow augmening,j-pah in G f } e!! "# $%&! " #$ " % # " & $ ' # # ' ( $ ) $ and ake a new dual oluion := + θ if i I* := - θ if i I* β j := β j - θ if j J* β j := β j + θ if i J* unil v(f) = # i 9- reurn flow f Inerpreaion For he ranporaion problem, he paradigm of he primal-dual algorihm lead o wo need loop of reachabiliy problem. The loop "combinaorialize" co and capaciie. Tranporaion Problem combinaorialize co Max-Flow-Problem combinaorialize capaciie Reachabiliy Problem find a flow augmening pah 6.8 Example Inpu daa

19 9- b j die c ij Marix Calculaing he dual oluion β j = min i c ij mark he admiible edge (i,j) Ieraion Conruc graph G of admiible edge and compue a maximum,-flow in G and he e I* and J* 9- G f I* J* flow value v(f) = 9 < # i = => updae he dual oluion Updaing he dual oluion Deermine θ β j!! "# $%&! " #$ " % # " & $ ' # # ' ( $ ) $ c ij marix

20 9- I* = { }, J* = { } edge (,) -> ( - - ) / = / edge (,) -> ( - - ) / = / => θ = / edge (,) -> ( - - ) / = Compuing he new dual oluion := + θ if i I* := - θ if i I* β j := β j - θ if j J* β j := β j + θ if i J* So α = / α = -/ α = -/ β = / β = / β = / β = / Ieraion Conruc graph G of admiible edge 9-6! # $ $! " " " " " / -/ -/ mark admiible edge G Compue a maximum,-flow in G and he e I* and J*

21 9-7 f I* J* f I* J* previou flow new flow flow value v(f) = < # i = => updae he dual oluion Updaing he dual oluion Deermine θ 9-8!! "# $%&! " #$ " % # " & $ ' # # ' ( $ ) $! # $ $! " " " " "! i / -/ -/ I* = {, }, J* = {,, } edge (,) -> ( - / - /) / = / edge (,) -> ( + / - /) / = / => θ = / Compue he new dual oluion := + θ if i I* := - θ if i I* β j := β j - θ if j J* β j := β j + θ if i J* So α = α = α = - β = β = β = β = Ieraion Conruc graph G of admiible edge

22 9-9 G β j - mark admiible edge Compue a maximum,-flow in G and he e I* and J* 9- f I* f J* previou flow new flow flow value v(f) = = # i = => have conruced an opimal oluion Runime of he algorihm Le w.o.l.g. m " n => G ha O(n) verice and O(n ) edge The primal objecive of (RP') increae wih every flow augmening pah and i bounded from above by # i. => oal runime for flow augmenaion i (# i ) O(breadh fir earch) = (# i )O(n )

23 9- All oher compuaion (conrucing G, θ, he new dual oluion) are in O(n ) and happen a mo (# i ) ime => Toal runime of he primal-dual algorihm i (# i )O(n ) => he primal-dual algorihm i only peudo-polynomial I can be improved by Capaciy Scaling for he and b j (ee ADM I, Secion 6., for capaciy caling) => eenially only log(max {, b j }) many max-flow problem wih runime O(n ) An inereing pecial cae he aignmen problem, which i defined by = b j = (hen n = m) => # i = n => runime O(n ) The alpha-bea algorihm wa fir developed for maximum weighed maching in biparie graph (Paul Kuhn 9) and i known a Hungarian mehod, ee e.g. A. Schrijver, Combinaorial Opimizaion: Polyhedra and Efficiency Volume, Chaper A primal-dual algorihmn for he weighed maching problem (a kech) - Goal of hi ecion Skech of a primal dual algorihm for weighed (perfec) maching. Thi cloe he gap from ADM I, Secion 7. Maching Le G be an undireced graph. A maching of G i a e M " E(G) of edge uch ha no edge of M hare an endpoin a maching M i called perfec if every verex of G i inciden o an edge of M a graph wih a perfec maching (red edge)

24 6.6 A primal-dual algorihmn for he weighed maching problem (a kech) - Maximum weigh maching problem (MWMP) Inance Undireced graph G, edge weigh c(e) Tak Find a maching M wih maximum weigh c(m)!!"" # # "!!#" Minimum weigh perfec maching problem (MWPMP) Inance Undireced graph G, edge weigh c(e) Tak Find a perfec maching M wih minimum weigh c(m) or repor ha here i no perfec maching 6.8 Lemma (Equivalence of maching problem) 6.6 A primal-dual algorihmn for he weighed maching problem (a kech) - MWMP and MWPMP are equivalen in he ene ha here i a imple ranformaion from one problem o he oher uch ha one can conruc from an opimal oluion of one problem an opimal oluion of he oher. Proof "=>" Le (G,c) be an inance of he minimum weigh perfec maching problem. Chooe K large enough o ha c'(e) := K - c(e) > for all edge e, and only maximum cardinaliy maching of G have maximum weigh w.r.. c'. ( K := + # e! M c(e) uffice) Le M be an opimal oluion of he maximum weigh maching problem for (G, c') M ha maximum cardinaliy => M i a perfec maching for (G,c) or here i no perfec maching in G If M i perfec, hen c'(m) = Kn/ - # e! M c(e). So M ha maximum weigh w.r.. c' iff M ha minimum weigh w.r.. c. "<=" Le (G,c) be an inance of he maximum weigh maching problem. Add V(G) many new verice o G and o many edge ha he new graph G' i complee. Se c'(e) := - c(e) if e E(G) and c'(e) := if e i a new edge. Le M' be an opimal oluion of he minimum weigh perfec maching problem for (G', c')

25 6.6 A primal-dual algorihmn for he weighed maching problem (a kech) - => M := M' $ E(G) i an opimal oluion of he maximum weigh maching problem! The primal-dual algorihm for he minimum weigh perfec maching problem Primal LP (P) There i no obviou LP-formulaion. Der following heorem wa one of he pioneering reul of Edmond. Given an inance (G,c) wih G = (V, E), he conider he LP (P) min # e! E c(e)x e x(δ(v)) = for all v V x(δ(s))! for all odd verex e S of G x! Here x(δ(s)) := # e! δ(s) x e 6.9 Theorem (Maching polyope Theorem, Edmond 96) Le (G,c) be an inance of he minimum weigh perfec maching problem. Then: () G ha a perfec maching <=> (P) ha a feaible oluion () In hi cae he minimum weigh of a perfec maching of G i equal o he opimal value of (P). Proof 6.6 A primal-dual algorihmn for he weighed maching problem (a kech) - The primal-dual algorihm conruc an opimal oluion x of (P) (if here i one) ha i a perfec maching of G. => Theorem 6.9 and Lemma. imply ha all baic feaible oluion of (P) correpond o perfec maching.! Dual LP (D) We do no ranform (P) ino andard form. Der primal-dual algorihm can be adaped alo o oher form of (P). Le U be he e of all odd verex e of G. The dual LP of (P) i (D) max #(y v : v V) + #(Y S : S U) y v + y w + #(Y S : e S U) " c(e) for all edge e = vw E Y S! for all S U y v unrericed Complemenary lackne condiion x e > => c(e) - (y v + y w + #(Y S : e S U)) =

26 6.6 A primal-dual algorihmn for he weighed maching problem (a kech) -6 Y S > => x(δ(s)) = If x i he incidence vecor of a perfec maching M, hen he complemenary lackne condiion are equivalen o e M => c(e) - (y v + y w + #(Y S : e S U)) = (6.8) Y S > => M $ δ(s) = (6.9) Remark on he primal-dual algorihm (6.8) define "admiible" edge for he maching ha we look for in he (RP) (6.9) correpond o M $ δ(v) =, if S ha been hrunk o a peudo-node v (a bloom) => a oluion of (RP) correpond eenially o earching a perfec (o a maximal) maching in he graph of admiible edge in which all e S wih Y S > are hrunk => we can compue uch a oluion wih he algorihm for a maximum cardinaliy maching (e.g. he one from ADM I). An opimal oluion of (DRP) can (imilar o he ranporaion problem) be obained direcly from he be maching in (RP), bu hi i more complicaed han for he ranporaion problem. Alogeher, he minimum weigh perfec maching problem reduce o a equence of maximum cardinaliy 6.6 A primal-dual algorihmn for he weighed maching problem (a kech) -7 maching problem. The algorihm can be implemened o run in O(n m) ime. In paricular, a mo n variable Y S > hroughou he algorihm. There are improvemen for dene graph (ha work only on pare ube of he edge) For deail ee Chaper. in W. J. Cook, W. H. Cunningham, W. R. Pulleyblank and A. Schrijver Combinaorial Opimizaion Wiley 998

The Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm

The Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,

More information

The Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm

The Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,

More information

Network Flows: Introduction & Maximum Flow

Network Flows: Introduction & Maximum Flow CSC 373 - lgorihm Deign, nalyi, and Complexiy Summer 2016 Lalla Mouaadid Nework Flow: Inroducion & Maximum Flow We now urn our aenion o anoher powerful algorihmic echnique: Local Search. In a local earch

More information

Main Reference: Sections in CLRS.

Main Reference: Sections in CLRS. Maximum Flow Reied 09/09/200 Main Reference: Secion 26.-26. in CLRS. Inroducion Definiion Muli-Source Muli-Sink The Ford-Fulkeron Mehod Reidual Nework Augmening Pah The Max-Flow Min-Cu Theorem The Edmond-Karp

More information

1 Motivation and Basic Definitions

1 Motivation and Basic Definitions CSCE : Deign and Analyi of Algorihm Noe on Max Flow Fall 20 (Baed on he preenaion in Chaper 26 of Inroducion o Algorihm, 3rd Ed. by Cormen, Leieron, Rive and Sein.) Moivaion and Baic Definiion Conider

More information

CS4445/9544 Analysis of Algorithms II Solution for Assignment 1

CS4445/9544 Analysis of Algorithms II Solution for Assignment 1 Conider he following flow nework CS444/944 Analyi of Algorihm II Soluion for Aignmen (0 mark) In he following nework a minimum cu ha capaciy 0 Eiher prove ha hi aemen i rue, or how ha i i fale Uing he

More information

Today: Max Flow Proofs

Today: Max Flow Proofs Today: Max Flow Proof COSC 58, Algorihm March 4, 04 Many of hee lide are adaped from everal online ource Reading Aignmen Today cla: Chaper 6 Reading aignmen for nex cla: Chaper 7 (Amorized analyi) In-Cla

More information

Soviet Rail Network, 1955

Soviet Rail Network, 1955 Sovie Rail Nework, 1 Reference: On he hiory of he ranporaion and maximum flow problem. Alexander Schrijver in Mah Programming, 1: 3,. Maximum Flow and Minimum Cu Max flow and min cu. Two very rich algorihmic

More information

Algorithmic Discrete Mathematics 6. Exercise Sheet

Algorithmic Discrete Mathematics 6. Exercise Sheet Algorihmic Dicree Mahemaic. Exercie Shee Deparmen of Mahemaic SS 0 PD Dr. Ulf Lorenz 7. and 8. Juni 0 Dipl.-Mah. David Meffer Verion of June, 0 Groupwork Exercie G (Heap-Sor) Ue Heap-Sor wih a min-heap

More information

Problem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow.

Problem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow. CSE 202: Deign and Analyi of Algorihm Winer 2013 Problem Se 3 Inrucor: Kamalika Chaudhuri Due on: Tue. Feb 26, 2013 Inrucion For your proof, you may ue any lower bound, algorihm or daa rucure from he ex

More information

Max Flow, Min Cut COS 521. Kevin Wayne Fall Soviet Rail Network, Cuts. Minimum Cut Problem. Flow network.

Max Flow, Min Cut COS 521. Kevin Wayne Fall Soviet Rail Network, Cuts. Minimum Cut Problem. Flow network. Sovie Rail Nework, Max Flow, Min u OS Kevin Wayne Fall Reference: On he hiory of he ranporaion and maximum flow problem. lexander Schrijver in Mah Programming, :,. Minimum u Problem u Flow nework.! Digraph

More information

Maximum Flow and Minimum Cut

Maximum Flow and Minimum Cut // Sovie Rail Nework, Maximum Flow and Minimum Cu Max flow and min cu. Two very rich algorihmic problem. Cornerone problem in combinaorial opimizaion. Beauiful mahemaical dualiy. Nework Flow Flow nework.

More information

! Abstraction for material flowing through the edges. ! G = (V, E) = directed graph, no parallel edges.

! Abstraction for material flowing through the edges. ! G = (V, E) = directed graph, no parallel edges. Sovie Rail Nework, haper Nework Flow Slide by Kevin Wayne. opyrigh Pearon-ddion Weley. ll righ reerved. Reference: On he hiory of he ranporaion and maximum flow problem. lexander Schrijver in Mah Programming,

More information

18 Extensions of Maximum Flow

18 Extensions of Maximum Flow Who are you?" aid Lunkwill, riing angrily from hi ea. Wha do you wan?" I am Majikhie!" announced he older one. And I demand ha I am Vroomfondel!" houed he younger one. Majikhie urned on Vroomfondel. I

More information

Graphs III - Network Flow

Graphs III - Network Flow Graph III - Nework Flow Flow nework eup graph G=(V,E) edge capaciy w(u,v) 0 - if edge doe no exi, hen w(u,v)=0 pecial verice: ource verex ; ink verex - no edge ino and no edge ou of Aume every verex v

More information

Soviet Rail Network, 1955

Soviet Rail Network, 1955 7.1 Nework Flow Sovie Rail Nework, 19 Reerence: On he hiory o he ranporaion and maximum low problem. lexander Schrijver in Mah Programming, 91: 3, 00. (See Exernal Link ) Maximum Flow and Minimum Cu Max

More information

Network Flow. Data Structures and Algorithms Andrei Bulatov

Network Flow. Data Structures and Algorithms Andrei Bulatov Nework Flow Daa Srucure and Algorihm Andrei Bulao Algorihm Nework Flow 24-2 Flow Nework Think of a graph a yem of pipe We ue hi yem o pump waer from he ource o ink Eery pipe/edge ha limied capaciy Flow

More information

CSE 521: Design & Analysis of Algorithms I

CSE 521: Design & Analysis of Algorithms I CSE 52: Deign & Analyi of Algorihm I Nework Flow Paul Beame Biparie Maching Given: A biparie graph G=(V,E) M E i a maching in G iff no wo edge in M hare a verex Goal: Find a maching M in G of maximum poible

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorihm Deign and Analyi LECTURES 17 Nework Flow Dualiy of Max Flow and Min Cu Algorihm: Ford-Fulkeron Capaciy Scaling Sofya Rakhodnikova S. Rakhodnikova; baed on lide by E. Demaine, C. Leieron, A. Smih,

More information

Flow networks. Flow Networks. A flow on a network. Flow networks. The maximum-flow problem. Introduction to Algorithms, Lecture 22 December 5, 2001

Flow networks. Flow Networks. A flow on a network. Flow networks. The maximum-flow problem. Introduction to Algorithms, Lecture 22 December 5, 2001 CS 545 Flow Nework lon Efra Slide courey of Charle Leieron wih mall change by Carola Wenk Flow nework Definiion. flow nework i a direced graph G = (V, E) wih wo diinguihed verice: a ource and a ink. Each

More information

Randomized Perfect Bipartite Matching

Randomized Perfect Bipartite Matching Inenive Algorihm Lecure 24 Randomized Perfec Biparie Maching Lecurer: Daniel A. Spielman April 9, 208 24. Inroducion We explain a randomized algorihm by Ahih Goel, Michael Kapralov and Sanjeev Khanna for

More information

Greedy. I Divide and Conquer. I Dynamic Programming. I Network Flows. Network Flow. I Previous topics: design techniques

Greedy. I Divide and Conquer. I Dynamic Programming. I Network Flows. Network Flow. I Previous topics: design techniques Algorihm Deign Technique CS : Nework Flow Dan Sheldon April, reedy Divide and Conquer Dynamic Programming Nework Flow Comparion Nework Flow Previou opic: deign echnique reedy Divide and Conquer Dynamic

More information

4/12/12. Applications of the Maxflow Problem 7.5 Bipartite Matching. Bipartite Matching. Bipartite Matching. Bipartite matching: the flow network

4/12/12. Applications of the Maxflow Problem 7.5 Bipartite Matching. Bipartite Matching. Bipartite Matching. Bipartite matching: the flow network // Applicaion of he Maxflow Problem. Biparie Maching Biparie Maching Biparie maching. Inpu: undireced, biparie graph = (, E). M E i a maching if each node appear in a mo one edge in M. Max maching: find

More information

Matching. Slides designed by Kevin Wayne.

Matching. Slides designed by Kevin Wayne. Maching Maching. Inpu: undireced graph G = (V, E). M E i a maching if each node appear in a mo edge in M. Max maching: find a max cardinaliy maching. Slide deigned by Kevin Wayne. Biparie Maching Biparie

More information

Flow networks, flow, maximum flow. Some definitions. Edmonton. Saskatoon Winnipeg. Vancouver Regina. Calgary. 12/12 a.

Flow networks, flow, maximum flow. Some definitions. Edmonton. Saskatoon Winnipeg. Vancouver Regina. Calgary. 12/12 a. Flow nework, flow, maximum flow Can inerpre direced graph a flow nework. Maerial coure hrough ome yem from ome ource o ome ink. Source produce maerial a ome eady rae, ink conume a ame rae. Example: waer

More information

Algorithms and Data Structures 2011/12 Week 9 Solutions (Tues 15th - Fri 18th Nov)

Algorithms and Data Structures 2011/12 Week 9 Solutions (Tues 15th - Fri 18th Nov) Algorihm and Daa Srucure 2011/ Week Soluion (Tue 15h - Fri 18h No) 1. Queion: e are gien 11/16 / 15/20 8/13 0/ 1/ / 11/1 / / To queion: (a) Find a pair of ube X, Y V uch ha f(x, Y) = f(v X, Y). (b) Find

More information

MAXIMUM FLOW. introduction Ford-Fulkerson algorithm maxflow-mincut theorem

MAXIMUM FLOW. introduction Ford-Fulkerson algorithm maxflow-mincut theorem MAXIMUM FLOW inroducion Ford-Fulkeron algorihm maxflow-mincu heorem Mincu problem Inpu. An edge-weighed digraph, ource verex, and arge verex. each edge ha a poiive capaciy capaciy 9 10 4 15 15 10 5 8 10

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorihm Deign and Analyi LECTURE 0 Nework Flow Applicaion Biparie maching Edge-dijoin pah Adam Smih 0//0 A. Smih; baed on lide by E. Demaine, C. Leieron, S. Rakhodnikova, K. Wayne La ime: Ford-Fulkeron

More information

Reminder: Flow Networks

Reminder: Flow Networks 0/0/204 Ma/CS 6a Cla 4: Variou (Flow) Execie Reminder: Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d

More information

Introduction to Congestion Games

Introduction to Congestion Games Algorihmic Game Theory, Summer 2017 Inroducion o Congeion Game Lecure 1 (5 page) Inrucor: Thoma Keelheim In hi lecure, we ge o know congeion game, which will be our running example for many concep in game

More information

6/3/2009. CS 244 Algorithm Design Instructor: t Artur Czumaj. Lecture 8 Network flows. Maximum Flow and Minimum Cut. Minimum Cut Problem.

6/3/2009. CS 244 Algorithm Design Instructor: t Artur Czumaj. Lecture 8 Network flows. Maximum Flow and Minimum Cut. Minimum Cut Problem. Maximum Flow and Minimum Cu CS lgorihm Deign Inrucor: rur Czumaj Lecure Nework Max and min cu. Two very rich algorihmic problem. Cornerone problem in combinaorial opimizaion. Beauiful mahemaical dualiy.

More information

CSC 364S Notes University of Toronto, Spring, The networks we will consider are directed graphs, where each edge has associated with it

CSC 364S Notes University of Toronto, Spring, The networks we will consider are directed graphs, where each edge has associated with it CSC 36S Noe Univeriy of Torono, Spring, 2003 Flow Algorihm The nework we will conider are direced graph, where each edge ha aociaed wih i a nonnegaive capaciy. The inuiion i ha if edge (u; v) ha capaciy

More information

Network Flows UPCOPENCOURSEWARE number 34414

Network Flows UPCOPENCOURSEWARE number 34414 Nework Flow UPCOPENCOURSEWARE number Topic : F.-Javier Heredia Thi work i licened under he Creaive Common Aribuion- NonCommercial-NoDeriv. Unpored Licene. To view a copy of hi licene, vii hp://creaivecommon.org/licene/by-nc-nd/./

More information

Maximum Flow in Planar Graphs

Maximum Flow in Planar Graphs Maximum Flow in Planar Graph Planar Graph and i Dual Dualiy i defined for direced planar graph a well Minimum - cu in undireced planar graph An - cu (undireced graph) An - cu The dual o he cu Cu/Cycle

More information

Admin MAX FLOW APPLICATIONS. Flow graph/networks. Flow constraints 4/30/13. CS lunch today Grading. in-flow = out-flow for every vertex (except s, t)

Admin MAX FLOW APPLICATIONS. Flow graph/networks. Flow constraints 4/30/13. CS lunch today Grading. in-flow = out-flow for every vertex (except s, t) /0/ dmin lunch oday rading MX LOW PPLIION 0, pring avid Kauchak low graph/nework low nework direced, weighed graph (V, ) poiive edge weigh indicaing he capaciy (generally, aume ineger) conain a ingle ource

More information

CS 473G Lecture 15: Max-Flow Algorithms and Applications Fall 2005

CS 473G Lecture 15: Max-Flow Algorithms and Applications Fall 2005 CS 473G Lecure 1: Max-Flow Algorihm and Applicaion Fall 200 1 Max-Flow Algorihm and Applicaion (November 1) 1.1 Recap Fix a direced graph G = (V, E) ha doe no conain boh an edge u v and i reveral v u,

More information

Flow Networks. Ma/CS 6a. Class 14: Flow Exercises

Flow Networks. Ma/CS 6a. Class 14: Flow Exercises 0/0/206 Ma/CS 6a Cla 4: Flow Exercie Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d e Sink 0/0/206 Flow

More information

Please Complete Course Survey. CMPSCI 311: Introduction to Algorithms. Approximation Algorithms. Coping With NP-Completeness. Greedy Vertex Cover

Please Complete Course Survey. CMPSCI 311: Introduction to Algorithms. Approximation Algorithms. Coping With NP-Completeness. Greedy Vertex Cover Pleae Complee Coure Survey CMPSCI : Inroducion o Algorihm Dealing wih NP-Compleene Dan Sheldon hp: //owl.oi.uma.edu/parner/coureevalsurvey/uma/ Univeriy of Maachue Slide Adaped from Kevin Wayne La Compiled:

More information

, the. L and the L. x x. max. i n. It is easy to show that these two norms satisfy the following relation: x x n x = (17.3) max

, the. L and the L. x x. max. i n. It is easy to show that these two norms satisfy the following relation: x x n x = (17.3) max ecure 8 7. Sabiliy Analyi For an n dimenional vecor R n, he and he vecor norm are defined a: = T = i n i (7.) I i eay o how ha hee wo norm aify he following relaion: n (7.) If a vecor i ime-dependen, hen

More information

16 Max-Flow Algorithms and Applications

16 Max-Flow Algorithms and Applications Algorihm A proce canno be underood by opping i. Underanding mu move wih he flow of he proce, mu join i and flow wih i. The Fir Law of Mena, in Frank Herber Dune (196) There a difference beween knowing

More information

Maximum Flow. Contents. Max Flow Network. Maximum Flow and Minimum Cut

Maximum Flow. Contents. Max Flow Network. Maximum Flow and Minimum Cut Conen Maximum Flow Conen. Maximum low problem. Minimum cu problem. Max-low min-cu heorem. Augmening pah algorihm. Capaciy-caling. Shore augmening pah. Princeon Univeriy COS Theory o Algorihm Spring Kevin

More information

Average Case Lower Bounds for Monotone Switching Networks

Average Case Lower Bounds for Monotone Switching Networks Average Cae Lower Bound for Monoone Swiching Nework Yuval Filmu, Toniann Piai, Rober Robere, Sephen Cook Deparmen of Compuer Science Univeriy of Torono Monoone Compuaion (Refreher) Monoone circui were

More information

Maximum Flow. How do we transport the maximum amount data from source to sink? Some of these slides are adapted from Lecture Notes of Kevin Wayne.

Maximum Flow. How do we transport the maximum amount data from source to sink? Some of these slides are adapted from Lecture Notes of Kevin Wayne. Conen Conen. Maximum flow problem. Minimum cu problem. Max-flow min-cu heorem. Augmening pah algorihm. Capaciy-caling. Shore augmening pah. Chaper Maximum How do we ranpor he maximum amoun daa from ource

More information

Introduction to SLE Lecture Notes

Introduction to SLE Lecture Notes Inroducion o SLE Lecure Noe May 13, 16 - The goal of hi ecion i o find a ufficien condiion of λ for he hull K o be generaed by a imple cure. I urn ou if λ 1 < 4 hen K i generaed by a imple curve. We will

More information

Chapter 7: Inverse-Response Systems

Chapter 7: Inverse-Response Systems Chaper 7: Invere-Repone Syem Normal Syem Invere-Repone Syem Baic Sar ou in he wrong direcion End up in he original eady-ae gain value Two or more yem wih differen magniude and cale in parallel Main yem

More information

Basic Tools CMSC 641. Running Time. Problem. Problem. Algorithmic Design Paradigms. lg (n!) (lg n)! (lg n) lgn n.2

Basic Tools CMSC 641. Running Time. Problem. Problem. Algorithmic Design Paradigms. lg (n!) (lg n)! (lg n) lgn n.2 Baic Tool CMSC April, Review Aympoic Noaion Order of Growh Recurrence relaion Daa Srucure Li, Heap, Graph, Tree, Balanced Tree, Hah Table Advanced daa rucure: Binomial Heap, Fibonacci Heap Soring Mehod

More information

23 Maximum Flows and Minimum Cuts

23 Maximum Flows and Minimum Cuts A proce canno be underood by opping i. Underanding mu move wih he flow of he proce, mu join i and flow wih i. The Fir Law of Mena, in Frank Herber Dune (196) Conrary o expecaion, flow uually happen no

More information

CMPS 6610/4610 Fall Flow Networks. Carola Wenk Slides adapted from slides by Charles Leiserson

CMPS 6610/4610 Fall Flow Networks. Carola Wenk Slides adapted from slides by Charles Leiserson CMP 6610/4610 Fall 2016 Flow Nework Carola Wenk lide adaped rom lide by Charle Leieron Max low and min c Fndamenal problem in combinaorial opimizaion Daliy beween max low and min c Many applicaion: Biparie

More information

Algorithms. Algorithms 6.4 MAXIMUM FLOW

Algorithms. Algorithms 6.4 MAXIMUM FLOW Algorihm ROBERT SEDGEWICK KEVIN WAYNE 6.4 MAXIMUM FLOW Algorihm F O U R T H E D I T I O N ROBERT SEDGEWICK KEVIN WAYNE hp://alg4.c.princeon.edu inroducion Ford Fulkeron algorihm maxflow mincu heorem analyi

More information

The Primal Simplex Approach to the QoS Routing Problem

The Primal Simplex Approach to the QoS Routing Problem The Primal Simplex Approach o he QoS Rouing Problem Ying Xiao, Krihnaiyan Thulairaman Univeriy of Oklahoma, Norman, OK {ying_xiao, hulai}@ou.edu Guoliang Xue Arizona Sae Univeriy, Tempe, AZ xue@au.edu

More information

Today s topics. CSE 421 Algorithms. Problem Reduction Examples. Problem Reduction. Undirected Network Flow. Bipartite Matching. Problem Reductions

Today s topics. CSE 421 Algorithms. Problem Reduction Examples. Problem Reduction. Undirected Network Flow. Bipartite Matching. Problem Reductions Today opic CSE Algorihm Richard Anderon Lecure Nework Flow Applicaion Prolem Reducion Undireced Flow o Flow Biparie Maching Dijoin Pah Prolem Circulaion Loweround conrain on flow Survey deign Prolem Reducion

More information

CSE 421 Introduction to Algorithms Winter The Network Flow Problem

CSE 421 Introduction to Algorithms Winter The Network Flow Problem CSE 42 Inroducion o Algorihm Winer 202 The Nework Flow Problem 2 The Nework Flow Problem 5 a 4 3 x 3 7 6 b 4 y 4 7 6 c 5 z How much uff can flow from o? 3 Sovie Rail Nework, 955 Reference: On he hiory

More information

3/3/2015. Chapter 7. Network Flow. Maximum Flow and Minimum Cut. Minimum Cut Problem

3/3/2015. Chapter 7. Network Flow. Maximum Flow and Minimum Cut. Minimum Cut Problem // Chaper Nework Flow Maximum Flow and Minimum Cu Max flow and min cu. Two very rich algorihmic problem. Cornerone problem in combinaorial opimizaion. Beauiful mahemaical dualiy. Nonrivial applicaion /

More information

Network Flow Applications

Network Flow Applications Hopial problem Neork Flo Applicaion Injured people: n Hopial: k Each peron need o be brough o a hopial no more han 30 minue aay Each hopial rea no more han n/k" people Gien n, k, and informaion abou people

More information

6.8 Laplace Transform: General Formulas

6.8 Laplace Transform: General Formulas 48 HAP. 6 Laplace Tranform 6.8 Laplace Tranform: General Formula Formula Name, ommen Sec. F() l{ f ()} e f () d f () l {F()} Definiion of Tranform Invere Tranform 6. l{af () bg()} al{f ()} bl{g()} Lineariy

More information

To become more mathematically correct, Circuit equations are Algebraic Differential equations. from KVL, KCL from the constitutive relationship

To become more mathematically correct, Circuit equations are Algebraic Differential equations. from KVL, KCL from the constitutive relationship Laplace Tranform (Lin & DeCarlo: Ch 3) ENSC30 Elecric Circui II The Laplace ranform i an inegral ranformaion. I ranform: f ( ) F( ) ime variable complex variable From Euler > Lagrange > Laplace. Hence,

More information

26.1 Flow networks. f (u,v) = 0.

26.1 Flow networks. f (u,v) = 0. 26 Maimum Flow Ju a we can model a road map a a direced graph in order o find he hore pah from one poin o anoher, we can alo inerpre a direced graph a a flow nework and ue i o anwer queion abou maerial

More information

Discussion Session 2 Constant Acceleration/Relative Motion Week 03

Discussion Session 2 Constant Acceleration/Relative Motion Week 03 PHYS 100 Dicuion Seion Conan Acceleraion/Relaive Moion Week 03 The Plan Today you will work wih your group explore he idea of reference frame (i.e. relaive moion) and moion wih conan acceleraion. You ll

More information

Network flows. The problem. c : V V! R + 0 [ f+1g. flow network G = (V, E, c), a source s and a sink t uv not in E implies c(u, v) = 0

Network flows. The problem. c : V V! R + 0 [ f+1g. flow network G = (V, E, c), a source s and a sink t uv not in E implies c(u, v) = 0 Nework flow The problem Seing flow nework G = (V, E, c), a orce and a ink no in E implie c(, ) = 0 Flow from o capaciy conrain kew-ymmery flow-coneraion ale of he flow jfj = P 2V Find a maximm flow from

More information

20/20 20/20 0/5 0/5 20/20 20/20 5/5 0/5 0/5 5/5 0/20 25/30 20/20 30/30 20/20 0/5 5/5 20/20 0/5 0/5 15/20 15/25 20/20 10/10

20/20 20/20 0/5 0/5 20/20 20/20 5/5 0/5 0/5 5/5 0/20 25/30 20/20 30/30 20/20 0/5 5/5 20/20 0/5 0/5 15/20 15/25 20/20 10/10 Annoncemen CSEP Applied Algorihm Richard Anderon Lecre 9 Nework Flow Applicaion Reading for hi week 7.-7.. Nework flow applicaion Nex week: Chaper 8. NP-Compleene Final exam, March 8, 6:0 pm. A UW. hor

More information

EECE 301 Signals & Systems Prof. Mark Fowler

EECE 301 Signals & Systems Prof. Mark Fowler EECE 31 Signal & Syem Prof. Mark Fowler Noe Se #27 C-T Syem: Laplace Tranform Power Tool for yem analyi Reading Aignmen: Secion 6.1 6.3 of Kamen and Heck 1/18 Coure Flow Diagram The arrow here how concepual

More information

Geometric Path Problems with Violations

Geometric Path Problems with Violations Click here o view linked Reference 1 1 1 0 1 0 1 0 1 0 1 Geomeric Pah Problem wih Violaion Anil Mahehwari 1, Subha C. Nandy, Drimi Paanayak, Saanka Roy and Michiel Smid 1 1 School of Compuer Science, Carleon

More information

Selfish Routing. Tim Roughgarden Cornell University. Includes joint work with Éva Tardos

Selfish Routing. Tim Roughgarden Cornell University. Includes joint work with Éva Tardos Selfih Rouing Tim Roughgarden Cornell Univeriy Include join work wih Éva Tardo 1 Which roue would you chooe? Example: one uni of raffic (e.g., car) wan o go from o delay = 1 hour (no congeion effec) long

More information

u(t) Figure 1. Open loop control system

u(t) Figure 1. Open loop control system Open loop conrol v cloed loop feedbac conrol The nex wo figure preen he rucure of open loop and feedbac conrol yem Figure how an open loop conrol yem whoe funcion i o caue he oupu y o follow he reference

More information

What is maximum Likelihood? History Features of ML method Tools used Advantages Disadvantages Evolutionary models

What is maximum Likelihood? History Features of ML method Tools used Advantages Disadvantages Evolutionary models Wha i maximum Likelihood? Hiory Feaure of ML mehod Tool ued Advanage Diadvanage Evoluionary model Maximum likelihood mehod creae all he poible ree conaining he e of organim conidered, and hen ue he aiic

More information

CHAPTER 7: SECOND-ORDER CIRCUITS

CHAPTER 7: SECOND-ORDER CIRCUITS EEE5: CI RCUI T THEORY CHAPTER 7: SECOND-ORDER CIRCUITS 7. Inroducion Thi chaper conider circui wih wo orage elemen. Known a econd-order circui becaue heir repone are decribed by differenial equaion ha

More information

Computer-Aided Analysis of Electronic Circuits Course Notes 3

Computer-Aided Analysis of Electronic Circuits Course Notes 3 Gheorghe Asachi Technical Universiy of Iasi Faculy of Elecronics, Telecommunicaions and Informaion Technologies Compuer-Aided Analysis of Elecronic Circuis Course Noes 3 Bachelor: Telecommunicaion Technologies

More information

18.03SC Unit 3 Practice Exam and Solutions

18.03SC Unit 3 Practice Exam and Solutions Sudy Guide on Sep, Dela, Convoluion, Laplace You can hink of he ep funcion u() a any nice mooh funcion which i for < a and for > a, where a i a poiive number which i much maller han any ime cale we care

More information

ARTIFICIAL INTELLIGENCE. Markov decision processes

ARTIFICIAL INTELLIGENCE. Markov decision processes INFOB2KI 2017-2018 Urech Univeriy The Neherland ARTIFICIAL INTELLIGENCE Markov deciion procee Lecurer: Silja Renooij Thee lide are par of he INFOB2KI Coure Noe available from www.c.uu.nl/doc/vakken/b2ki/chema.hml

More information

Physics 240: Worksheet 16 Name

Physics 240: Worksheet 16 Name Phyic 4: Workhee 16 Nae Non-unifor circular oion Each of hee proble involve non-unifor circular oion wih a conan α. (1) Obain each of he equaion of oion for non-unifor circular oion under a conan acceleraion,

More information

Random Walk with Anti-Correlated Steps

Random Walk with Anti-Correlated Steps Random Walk wih Ani-Correlaed Seps John Noga Dirk Wagner 2 Absrac We conjecure he expeced value of random walks wih ani-correlaed seps o be exacly. We suppor his conjecure wih 2 plausibiliy argumens and

More information

I. Introduction to place/transition nets. Place/Transition Nets I. Example: a vending machine. Example: a vending machine

I. Introduction to place/transition nets. Place/Transition Nets I. Example: a vending machine. Example: a vending machine Inroducory Tuorial I. Inroducion o place/ransiion nes Place/Transiion Nes I Prepared by: Jörg Desel, Caholic Universiy in Eichsä and Karsen Schmid, Humbold-Universiä zu Berlin Speaker: Wolfgang Reisig,

More information

Additional Methods for Solving DSGE Models

Additional Methods for Solving DSGE Models Addiional Mehod for Solving DSGE Model Karel Meren, Cornell Univeriy Reference King, R. G., Ploer, C. I. & Rebelo, S. T. (1988), Producion, growh and buine cycle: I. he baic neoclaical model, Journal of

More information

arxiv: v1 [cs.cg] 21 Mar 2013

arxiv: v1 [cs.cg] 21 Mar 2013 On he rech facor of he Thea-4 graph Lui Barba Proenji Boe Jean-Lou De Carufel André van Renen Sander Verdoncho arxiv:1303.5473v1 [c.cg] 21 Mar 2013 Abrac In hi paper we how ha he θ-graph wih 4 cone ha

More information

Stationary Distribution. Design and Analysis of Algorithms Andrei Bulatov

Stationary Distribution. Design and Analysis of Algorithms Andrei Bulatov Saionary Disribuion Design and Analysis of Algorihms Andrei Bulaov Algorihms Markov Chains 34-2 Classificaion of Saes k By P we denoe he (i,j)-enry of i, j Sae is accessible from sae if 0 for some k 0

More information

Efficient Algorithms for Computing Disjoint QoS Paths

Efficient Algorithms for Computing Disjoint QoS Paths Efficien Algorihm for Compuing Dijoin QoS Pah Ariel Orda and Alexander Sprinon 1 Deparmen of Elecrical Engineering, Technion Irael Iniue of Technology, Haifa, Irael 32000 Email: ariel@eeechnionacil Parallel

More information

Stability in Distribution for Backward Uncertain Differential Equation

Stability in Distribution for Backward Uncertain Differential Equation Sabiliy in Diribuion for Backward Uncerain Differenial Equaion Yuhong Sheng 1, Dan A. Ralecu 2 1. College of Mahemaical and Syem Science, Xinjiang Univeriy, Urumqi 8346, China heng-yh12@mail.inghua.edu.cn

More information

Mon Apr 2: Laplace transform and initial value problems like we studied in Chapter 5

Mon Apr 2: Laplace transform and initial value problems like we studied in Chapter 5 Mah 225-4 Week 2 April 2-6 coninue.-.3; alo cover par of.4-.5, EP 7.6 Mon Apr 2:.-.3 Laplace ranform and iniial value problem like we udied in Chaper 5 Announcemen: Warm-up Exercie: Recall, The Laplace

More information

5.2 GRAPHICAL VELOCITY ANALYSIS Polygon Method

5.2 GRAPHICAL VELOCITY ANALYSIS Polygon Method ME 352 GRHICL VELCITY NLYSIS 52 GRHICL VELCITY NLYSIS olygon Mehod Velociy analyi form he hear of kinemaic and dynamic of mechanical yem Velociy analyi i uually performed following a poiion analyi; ie,

More information

Price of Stability and Introduction to Mechanism Design

Price of Stability and Introduction to Mechanism Design Algorihmic Game Theory Summer 2017, Week 5 ETH Zürich Price of Sabiliy and Inroducion o Mechanim Deign Paolo Penna Thi i he lecure where we ar deigning yem which involve elfih player. Roughly peaking,

More information

Generalized Orlicz Spaces and Wasserstein Distances for Convex-Concave Scale Functions

Generalized Orlicz Spaces and Wasserstein Distances for Convex-Concave Scale Functions Generalized Orlicz Space and Waerein Diance for Convex-Concave Scale Funcion Karl-Theodor Surm Abrac Given a ricly increaing, coninuou funcion ϑ : R + R +, baed on he co funcional ϑ (d(x, y dq(x, y, we

More information

April 3, The maximum flow problem. See class notes on website.

April 3, The maximum flow problem. See class notes on website. 5.05 April, 007 The maximum flow problem See cla noe on webie. Quoe of he day You ge he maxx for he minimum a TJ Maxx. -- ad for a clohing ore Thi wa he mo unkinde cu of all -- Shakepeare in Juliu Caear

More information

Chapter 6. Laplace Transforms

Chapter 6. Laplace Transforms Chaper 6. Laplace Tranform Kreyzig by YHLee;45; 6- An ODE i reduced o an algebraic problem by operaional calculu. The equaion i olved by algebraic manipulaion. The reul i ranformed back for he oluion of

More information

1 Review of Zero-Sum Games

1 Review of Zero-Sum Games COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any

More information

7.5 Bipartite Matching. Chapter 7. Network Flow. Matching. Bipartite Matching

7.5 Bipartite Matching. Chapter 7. Network Flow. Matching. Bipartite Matching Chaper. Biparie Maching Nework Flow Slide by Kein Wayne. Copyrigh 00 Pearon-Addion Weley. All righ reered. Maching Biparie Maching Maching. Inpu: undireced graph G = (V, E). M E i a maching if each node

More information

Lecture 20: Riccati Equations and Least Squares Feedback Control

Lecture 20: Riccati Equations and Least Squares Feedback Control 34-5 LINEAR SYSTEMS Lecure : Riccai Equaions and Leas Squares Feedback Conrol 5.6.4 Sae Feedback via Riccai Equaions A recursive approach in generaing he marix-valued funcion W ( ) equaion for i for he

More information

Lecture 2 October ε-approximation of 2-player zero-sum games

Lecture 2 October ε-approximation of 2-player zero-sum games Opimizaion II Winer 009/10 Lecurer: Khaled Elbassioni Lecure Ocober 19 1 ε-approximaion of -player zero-sum games In his lecure we give a randomized ficiious play algorihm for obaining an approximae soluion

More information

Laplace Transform. Inverse Laplace Transform. e st f(t)dt. (2)

Laplace Transform. Inverse Laplace Transform. e st f(t)dt. (2) Laplace Tranform Maoud Malek The Laplace ranform i an inegral ranform named in honor of mahemaician and aronomer Pierre-Simon Laplace, who ued he ranform in hi work on probabiliy heory. I i a powerful

More information

7. NETWORK FLOW I. Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley. Last updated on 11/22/17 6:11 AM

7. NETWORK FLOW I. Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley. Last updated on 11/22/17 6:11 AM 7. NETWORK FLOW I max-flow and min-cu problem Ford Fulkeron algorihm max-flow min-cu heorem capaciy-caling algorihm hore augmening pah blocking-flow algorihm imple uni-capaciy nework Lecure lide by Kevin

More information

Research Article On Double Summability of Double Conjugate Fourier Series

Research Article On Double Summability of Double Conjugate Fourier Series Inernaional Journal of Mahemaic and Mahemaical Science Volume 22, Aricle ID 4592, 5 page doi:.55/22/4592 Reearch Aricle On Double Summabiliy of Double Conjugae Fourier Serie H. K. Nigam and Kuum Sharma

More information

Wrap up: Weighted, directed graph shortest path Minimum Spanning Tree. Feb 25, 2019 CSCI211 - Sprenkle

Wrap up: Weighted, directed graph shortest path Minimum Spanning Tree. Feb 25, 2019 CSCI211 - Sprenkle Objecive Wrap up: Weighed, direced graph hore pah Minimum Spanning Tree eb, 1 SI - Sprenkle 1 Review Wha are greedy algorihm? Wha i our emplae for olving hem? Review he la problem we were working on: Single-ource,

More information

13.1 Circuit Elements in the s Domain Circuit Analysis in the s Domain The Transfer Function and Natural Response 13.

13.1 Circuit Elements in the s Domain Circuit Analysis in the s Domain The Transfer Function and Natural Response 13. Chaper 3 The Laplace Tranform in Circui Analyi 3. Circui Elemen in he Domain 3.-3 Circui Analyi in he Domain 3.4-5 The Tranfer Funcion and Naural Repone 3.6 The Tranfer Funcion and he Convoluion Inegral

More information

NECESSARY AND SUFFICIENT CONDITIONS FOR LATENT SEPARABILITY

NECESSARY AND SUFFICIENT CONDITIONS FOR LATENT SEPARABILITY NECESSARY AND SUFFICIENT CONDITIONS FOR LATENT SEPARABILITY Ian Crawford THE INSTITUTE FOR FISCAL STUDIES DEPARTMENT OF ECONOMICS, UCL cemmap working paper CWP02/04 Neceary and Sufficien Condiion for Laen

More information

Let. x y. denote a bivariate time series with zero mean.

Let. x y. denote a bivariate time series with zero mean. Linear Filer Le x y : T denoe a bivariae ime erie wih zero mean. Suppoe ha he ime erie {y : T} i conruced a follow: y a x The ime erie {y : T} i aid o be conruced from {x : T} by mean of a Linear Filer.

More information

Chapter 6. Laplace Transforms

Chapter 6. Laplace Transforms 6- Chaper 6. Laplace Tranform 6.4 Shor Impule. Dirac Dela Funcion. Parial Fracion 6.5 Convoluion. Inegral Equaion 6.6 Differeniaion and Inegraion of Tranform 6.7 Syem of ODE 6.4 Shor Impule. Dirac Dela

More information

Global Optimization for Scheduling Refinery Crude Oil Operations

Global Optimization for Scheduling Refinery Crude Oil Operations Global Opimizaion for Scheduling Refinery Crude Oil Operaions Ramkumar Karuppiah 1, Kevin C. Furman 2 and Ignacio E. Grossmann 1 (1) Deparmen of Chemical Engineering Carnegie Mellon Universiy (2) Corporae

More information

FLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER

FLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER #A30 INTEGERS 10 (010), 357-363 FLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER Nahan Kaplan Deparmen of Mahemaic, Harvard Univeriy, Cambridge, MA nkaplan@mah.harvard.edu Received: 7/15/09, Revied:

More information

Selfish Routing and the Price of Anarchy. Tim Roughgarden Cornell University

Selfish Routing and the Price of Anarchy. Tim Roughgarden Cornell University Selfih Rouing and he Price of Anarchy Tim Roughgarden Cornell Univeriy 1 Algorihm for Self-Inereed Agen Our focu: problem in which muliple agen (people, compuer, ec.) inerac Moivaion: he Inerne decenralized

More information

Scheduling of Crude Oil Movements at Refinery Front-end

Scheduling of Crude Oil Movements at Refinery Front-end Scheduling of Crude Oil Movemens a Refinery Fron-end Ramkumar Karuppiah and Ignacio Grossmann Carnegie Mellon Universiy ExxonMobil Case Sudy: Dr. Kevin Furman Enerprise-wide Opimizaion Projec March 15,

More information

MATH 5720: Gradient Methods Hung Phan, UMass Lowell October 4, 2018

MATH 5720: Gradient Methods Hung Phan, UMass Lowell October 4, 2018 MATH 5720: Gradien Mehods Hung Phan, UMass Lowell Ocober 4, 208 Descen Direcion Mehods Consider he problem min { f(x) x R n}. The general descen direcions mehod is x k+ = x k + k d k where x k is he curren

More information