Forthcoming articles.
- Published in:
- Networks, 1989, v. 19, n. 4, p. i, doi. 10.1002/net.3230190408
- Publication type:
- Article
Works matching IS 00283045 AND DT 1989 AND VI 19 AND IP 4
Results: 8
1
2
A continuous-time network simplex algorithm.
- Published in:
- Networks, 1989, v. 19, n. 4, p. 395, doi. 10.1002/net.3230190403
- By:
- Publication type:
- Article
3
Statistical procedures for estimating branch flows and total network flow.
- Published in:
- Networks, 1989, v. 19, n. 4, p. 481, doi. 10.1002/net.3230190407
- By:
- Publication type:
- Article
4
An algorithm for the resource constrained shortest path problem.
- Published in:
- Networks, 1989, v. 19, n. 4, p. 379, doi. 10.1002/net.3230190402
- By:
- Publication type:
- Article
5
A new algorithm for general matching problems using network flow subproblems.
- Published in:
- Networks, 1989, v. 19, n. 4, p. 459, doi. 10.1002/net.3230190406
- By:
- Publication type:
- Article
6
Masthead.
- Published in:
- Networks, 1989, v. 19, n. 4, p. fmi, doi. 10.1002/net.3230190401
- Publication type:
- Article
7
On mean distance in certain classes of graphs.
- Published in:
- Networks, 1989, v. 19, n. 4, p. 451, doi. 10.1002/net.3230190405
- By:
- Publication type:
- Article
8
Designing satellite communication networks by zero-one quadratic programming.
- Published in:
- Networks, 1989, v. 19, n. 4, p. 427, doi. 10.1002/net.3230190404
- By:
- Publication type:
- Article