A cut-flow procedure for transportation network optimization.
- Published in:
- Networks, 1980, v. 10, n. 1, p. 33, doi. 10.1002/net.3230100104
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1980 AND VI 10 AND IP 1
Results: 9
1
2
Four-terminus flows.
- Published in:
- Networks, 1980, v. 10, n. 1, p. 79, doi. 10.1002/net.3230100108
- By:
- Publication type:
- Article
3
The cyclic method of solving the transshipment problem with an additional linear constraint.
- Published in:
- Networks, 1980, v. 10, n. 1, p. 17, doi. 10.1002/net.3230100103
- By:
- Publication type:
- Article
4
A theorem concerning cyclic directed graphs with applications to network reliability.
- Published in:
- Networks, 1980, v. 10, n. 1, p. 71, doi. 10.1002/net.3230100107
- By:
- Publication type:
- Article
5
Network methods in models of production.
- Published in:
- Networks, 1980, v. 10, n. 1, p. 1, doi. 10.1002/net.3230100102
- By:
- Publication type:
- Article
6
Minimum-time line broadcast networks.
- Published in:
- Networks, 1980, v. 10, n. 1, p. 59, doi. 10.1002/net.3230100106
- By:
- Publication type:
- Article
7
Masthead.
- Published in:
- Networks, 1980, v. 10, n. 1, p. fmi, doi. 10.1002/net.3230100101
- Publication type:
- Article
8
Maximum degree in graphs of diameter 2.
- Published in:
- Networks, 1980, v. 10, n. 1, p. 87, doi. 10.1002/net.3230100109
- By:
- Publication type:
- Article
9
Maximal expected flow in a network subject to arc failures.
- Published in:
- Networks, 1980, v. 10, n. 1, p. 45, doi. 10.1002/net.3230100105
- By:
- Publication type:
- Article