Counting formulas for tree growth plans.
- Published in:
- Networks, 1982, v. 12, n. 1, p. 41, doi. 10.1002/net.3230120104
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1982 AND VI 12 AND IP 1
Results: 7
1
2
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem.
- Published in:
- Networks, 1982, v. 12, n. 1, p. 23, doi. 10.1002/net.3230120103
- By:
- Publication type:
- Article
3
Algorithms for Network Programming, by J. L. Kennington and R. V. Helgason, Wiley, New York, 1980, 291 pp. Price: $25.00.
- Published in:
- Networks, 1982, v. 12, n. 1, p. 87, doi. 10.1002/net.3230120107
- By:
- Publication type:
- Article
4
Minimum cost flow with set-constraints.
- Published in:
- Networks, 1982, v. 12, n. 1, p. 1, doi. 10.1002/net.3230120102
- By:
- Publication type:
- Article
5
Locating mobile servers on a network with markovian properties.
- Published in:
- Networks, 1982, v. 12, n. 1, p. 73, doi. 10.1002/net.3230120106
- By:
- Publication type:
- Article
6
Masthead.
- Published in:
- Networks, 1982, v. 12, n. 1, p. fmi, doi. 10.1002/net.3230120101
- Publication type:
- Article
7
The general multimodal network equilibrium problem with elastic demand.
- Published in:
- Networks, 1982, v. 12, n. 1, p. 57, doi. 10.1002/net.3230120105
- By:
- Publication type:
- Article