## Network Flow, Transportation, and Scheduling; Theory and Algorithms |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Other editions - View all

Network Flow, Transportation, and Scheduling; Theory and Algorithms Masao Iri No preview available - 1969 |

### Common terms and phrases

2-isomorphic arbitrary associated minimum-route problem branch bx branch characteristics capacity Chapter column conductive path connected components convex function convex set corresponding cotree CURI CURI CURI current source deﬁned deﬁnition denote diodes dual elementary closed path elementary cutset entrance equal exit feasible ﬂow conﬁguration feasible tension conﬁguration ﬁnd ﬁnite ﬁrst ﬁx ﬂow and tension follows given graph horizontal segment incidence matrix incremental ﬂow inﬁnite internal branches intrinsic branches Labyrinth Algorithm linear programming linear subspace loop-free maximal independent set maximum minimal minimum negative direction NETW NETW NETW nﬂ node nonnegative nonnull null number of branches obtained pair partially ordered set positive direction primitive cutset matrix proof reference branch regard relation REMARK RICHARD BELLMAN satisﬁed segregation sequence set of branches shown in Fig solve source of value subgraph subset Theorem transformation two-terminal network vector vertical segment voltage source