Masthead.
- Published in:
- Networks, 1984, v. 14, n. 1, p. fmi, doi. 10.1002/net.3230140101
- Publication type:
- Article
Works matching IS 00283045 AND DT 1984 AND VI 14 AND IP 1
Results: 18
1
2
An algorithm for the steiner problem in graphs.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 147, doi. 10.1002/net.3230140112
- By:
- Publication type:
- Article
3
Graphs with the smallest number of minimum cut sets.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 47, doi. 10.1002/net.3230140105
- By:
- Publication type:
- Article
4
Bond graphs for modeling engineering systems, by A. J. Blundell, Halstead, Ellis Horwood Limited, London, 1982, 151 pp. Price: $44.95.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 176, doi. 10.1002/net.3230140116
- By:
- Publication type:
- Article
5
Algorithms for finding paths with multiple constraints.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 95, doi. 10.1002/net.3230140109
- By:
- Publication type:
- Article
6
Vulnerability of communication networks.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 141, doi. 10.1002/net.3230140111
- By:
- Publication type:
- Article
7
On the computational complexity of the minimum-dummy-activities problem in a pert network.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 37, doi. 10.1002/net.3230140104
- By:
- Publication type:
- Article
8
Dynamic programming: Models and applications, by Eric V. Denardo, Prentice-Hall, Englewood Cliffs, NJ, 1932, 227 pp. Price: $26.95.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 174, doi. 10.1002/net.3230140115
- By:
- Publication type:
- Article
9
On-line connectivity algorithms.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 83, doi. 10.1002/net.3230140108
- By:
- Publication type:
- Article
10
a generalized network flow model with application to power supply-demand problems.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 117, doi. 10.1002/net.3230140110
- By:
- Publication type:
- Article
11
Computational study of an improved shortest path algorithm.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 25, doi. 10.1002/net.3230140103
- By:
- Publication type:
- Article
12
Reviews in graph theory, edited by William G. Brown, American Mathematical Society, 1980. Volumes I, II, III, IV (paperback).
- Published in:
- Networks, 1984, v. 14, n. 1, p. 173, doi. 10.1002/net.3230140114
- By:
- Publication type:
- Article
13
A special spatial equilibrium problem.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 75, doi. 10.1002/net.3230140107
- By:
- Publication type:
- Article
14
Introduction to mathematical programming: Quantitative tools for decision-making, by Benjamin Lev and Howard J. Weiss, North-Holland, New York, 1982, 287 pp. Price: $39.50.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 178, doi. 10.1002/net.3230140118
- By:
- Publication type:
- Article
15
On the np-completeness of certain network testing problems.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 1, doi. 10.1002/net.3230140102
- By:
- Publication type:
- Article
16
Two exact algorithms for the distance-constrained vehicle routing problem.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 161, doi. 10.1002/net.3230140113
- By:
- Publication type:
- Article
17
An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 63, doi. 10.1002/net.3230140106
- By:
- Publication type:
- Article
18
Mathematical aspects of scheduling and applications, by R. Bellman, A. O. Esogbue, and I. Nabeshima, Pergamon, London, 1982, 329 pp. Price: $19.50.
- Published in:
- Networks, 1984, v. 14, n. 1, p. 177, doi. 10.1002/net.3230140117
- By:
- Publication type:
- Article