Algorithm 250: inverse permutation [G6]

B.H. Boonstra · Communications of the ACM · 1965

arcs," its~ integer array [, J, cost, hi, lo, flow, pi," label INFEAS," tlrii~ comment This procedure determines the least+cost flow patldeii' ~ tern are from ~{~ '~ml)l)et sink" to "super souree"-..-subjeet to the eapa('ity

Read the paper · More papers on PaperTik