Found: 12
Select item for more details and to access through your institution.
Stochastic bottleneck spanning tree problem.
- Published in:
- Networks, 1983, v. 13, n. 3, p. 443, doi. 10.1002/net.3230130311
- By:
- Publication type:
- Article
Anticenters and antimedians of a network.
- Published in:
- Networks, 1983, v. 13, n. 3, p. 359, doi. 10.1002/net.3230130304
- By:
- Publication type:
- Article
Finding a manhattan path and related problems.
- Published in:
- Networks, 1983, v. 13, n. 3, p. 399, doi. 10.1002/net.3230130308
- By:
- Publication type:
- Article
A Newton method for convex separable network flow problems.
- Published in:
- Networks, 1983, v. 13, n. 3, p. 427, doi. 10.1002/net.3230130310
- By:
- Publication type:
- Article
Conditional connectivity.
- Published in:
- Networks, 1983, v. 13, n. 3, p. 347, doi. 10.1002/net.3230130303
- By:
- Publication type:
- Article
Routing past unions of disjoint linear barriers.
- Published in:
- Networks, 1983, v. 13, n. 3, p. 389, doi. 10.1002/net.3230130307
- By:
- Publication type:
- Article
I-Colorings, I-Phasings, and I-Intersection assignments for graphs, and their applications.
- Published in:
- Networks, 1983, v. 13, n. 3, p. 327, doi. 10.1002/net.3230130302
- By:
- Publication type:
- Article
An algorithm for constructing edge-trees from hypergraphs.
- Published in:
- Networks, 1983, v. 13, n. 3, p. 377, doi. 10.1002/net.3230130306
- By:
- Publication type:
- Article
Linear and Combinatorial Optimization in Ordered Algebraic Structures, by U. Zimmermann, North-Holland, Amsterdam, 1981, 380 pp. Price: $61.00.
- Published in:
- Networks, 1983, v. 13, n. 3, p. 451, doi. 10.1002/net.3230130312
- By:
- Publication type:
- Article
Circuit partitioning with size and connection constraints.
- Published in:
- Networks, 1983, v. 13, n. 3, p. 365, doi. 10.1002/net.3230130305
- By:
- Publication type:
- Article
Lower planes for the network design problem.
- Published in:
- Networks, 1983, v. 13, n. 3, p. 411, doi. 10.1002/net.3230130309
- By:
- Publication type:
- Article
Optimal I-Intersection assignments for graphs: A linear programming approach.
- Published in:
- Networks, 1983, v. 13, n. 3, p. 317, doi. 10.1002/net.3230130301
- By:
- Publication type:
- Article