Radial location theory.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 233, doi. 10.1002/net.3230130207
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1983 AND VI 13 AND IP 2
Results: 22
1
2
Sequencing and scheduling-an introduction to the mathematics of the job-shop, by Simon French, Wiley, 1982, 245 pp. Price: $49.95.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 310, doi. 10.1002/net.3230130218
- By:
- Publication type:
- Article
3
Computational algorithms for closed queueing networks, by Steven C. Bruell and Gianfranco Balbo, North Holland, 1980, 190 pp. Price: $22.95.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 313, doi. 10.1002/net.3230130220
- By:
- Publication type:
- Article
4
Steiner trees, partial 2-trees, and minimum IFI networks.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 159, doi. 10.1002/net.3230130202
- By:
- Publication type:
- Article
5
Capacity expansion-analysis of simple models with applications, by John Freidenfels, North Holland, 1981, 291 pp. Price: $39.50.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 303, doi. 10.1002/net.3230130213
- By:
- Publication type:
- Article
6
Construction of centered shortest-path trees in networks.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 207, doi. 10.1002/net.3230130206
- By:
- Publication type:
- Article
7
Advanced linear programming: Computation and practice, by Bruce A. Murtagh, McGraw-Hill, New York, 1981, 202 pp. Price: $39.50.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 308, doi. 10.1002/net.3230130217
- By:
- Publication type:
- Article
8
Masthead.
- Published in:
- Networks, 1983, v. 13, n. 2, p. fmi, doi. 10.1002/net.3230130201
- Publication type:
- Article
9
Shortest chain subject to side constraints.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 295, doi. 10.1002/net.3230130212
- By:
- Publication type:
- Article
10
A network decomposition/aggregation procedure for a class of multicommodity transportation problems.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 197, doi. 10.1002/net.3230130205
- By:
- Publication type:
- Article
11
Computer networks, by Andrew S. Tanenbaum, Prentice-Hall, Englewood Cliffs, New Jersey, 1981, 517 pp. Price: $28.00.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 307, doi. 10.1002/net.3230130216
- By:
- Publication type:
- Article
12
An algorithm for finding a large independent set in planar graphs.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 247, doi. 10.1002/net.3230130209
- By:
- Publication type:
- Article
13
Centralized teleprocessing network design.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 279, doi. 10.1002/net.3230130211
- By:
- Publication type:
- Article
14
Linear programming, by Ronald I. Rothenberg, Elsevier North Holland, New York, 1979, 359pp. Price: $24.95.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 315, doi. 10.1002/net.3230130222
- By:
- Publication type:
- Article
15
A note on Arc tolerances in sparse shortest-path and network flow problems.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 191, doi. 10.1002/net.3230130204
- By:
- Publication type:
- Article
16
Communication control in computer networks, by Josef Puzman and Radoslav Porizek, Wiley, New York, 1980, 296 pp. Price: $39.50.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 305, doi. 10.1002/net.3230130215
- By:
- Publication type:
- Article
17
A recursive algorithm for directed-graph reliability.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 241, doi. 10.1002/net.3230130208
- By:
- Publication type:
- Article
18
Matrix-geometric solutions in stochastic models: An algorithmic approach, by Marcel R. Neuts, The Johns Hopkins University Press, Baltimore, 1981, 352 pp. Price: $32.50.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 311, doi. 10.1002/net.3230130219
- By:
- Publication type:
- Article
19
Calculating bounds on reachability and connectedness in stochastic networks.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 253, doi. 10.1002/net.3230130210
- By:
- Publication type:
- Article
20
Computer systems performance modeling, by Charles H. Sauer and K. Mani Chandy, Prentice-Hall, 1981, 352pp. Price: $18.95.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 314, doi. 10.1002/net.3230130221
- By:
- Publication type:
- Article
21
Constructing a minimal-cost spanning tree subject to resource constraints and flow requirements.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 169, doi. 10.1002/net.3230130203
- By:
- Publication type:
- Article
22
Algorithmic graph theory and perfect graphs, by Martin C. Golumbic, Academic, New York, 284 pp. Price: $34.00.
- Published in:
- Networks, 1983, v. 13, n. 2, p. 304, doi. 10.1002/net.3230130214
- By:
- Publication type:
- Article