Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle.
- Published in:
- Networks, 1990, v. 20, n. 4, p. 453, doi. 10.1002/net.3230200407
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1990 AND VI 20 AND IP 4
Results: 7
1
2
Disjoint ( s, t)-cuts in a network.
- Published in:
- Networks, 1990, v. 20, n. 4, p. 361, doi. 10.1002/net.3230200402
- By:
- Publication type:
- Article
3
A graph-theoretic approach to investigate structural and qualitative properties of systems: A survey.
- Published in:
- Networks, 1990, v. 20, n. 4, p. 427, doi. 10.1002/net.3230200406
- By:
- Publication type:
- Article
4
Masthead.
- Published in:
- Networks, 1990, v. 20, n. 4, p. fmi, doi. 10.1002/net.3230200401
- Publication type:
- Article
5
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities.
- Published in:
- Networks, 1990, v. 20, n. 4, p. 409, doi. 10.1002/net.3230200405
- By:
- Publication type:
- Article
6
Optimal location of a path or tree on a network with cycles.
- Published in:
- Networks, 1990, v. 20, n. 4, p. 391, doi. 10.1002/net.3230200404
- By:
- Publication type:
- Article
7
A heuristic algorithm for a network problem with variable upper bounds.
- Published in:
- Networks, 1990, v. 20, n. 4, p. 373, doi. 10.1002/net.3230200403
- By:
- Publication type:
- Article