Matching problems with generalized upper bound side constraints.
- Published in:
- Networks, 1990, v. 20, n. 6, p. 703, doi. 10.1002/net.3230200602
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1990 AND VI 20 AND IP 6
Results: 8
1
2
A lower bound for the steiner tree problem in directed graphs.
- Published in:
- Networks, 1990, v. 20, n. 6, p. 765, doi. 10.1002/net.3230200606
- By:
- Publication type:
- Article
3
Hierarchical solution of network flow problems.
- Published in:
- Networks, 1990, v. 20, n. 6, p. 731, doi. 10.1002/net.3230200604
- By:
- Publication type:
- Article
4
Theory of linear and integer programming, by Alexander Schrijver, Wiley, New York, 1986, 471 pp. Price $71.95.
- Published in:
- Networks, 1990, v. 20, n. 6, p. 801, doi. 10.1002/net.3230200608
- By:
- Publication type:
- Article
5
Masthead.
- Published in:
- Networks, 1990, v. 20, n. 6, p. fmi, doi. 10.1002/net.3230200601
- Publication type:
- Article
6
On the construction of optimally reliable graphs.
- Published in:
- Networks, 1990, v. 20, n. 6, p. 723, doi. 10.1002/net.3230200603
- By:
- Publication type:
- Article
7
Time-dependent traveling salesman problem-the deliveryman case.
- Published in:
- Networks, 1990, v. 20, n. 6, p. 753, doi. 10.1002/net.3230200605
- By:
- Publication type:
- Article
8
Worst-case greedy matchings in the unit d-cube.
- Published in:
- Networks, 1990, v. 20, n. 6, p. 779, doi. 10.1002/net.3230200607
- By:
- Publication type:
- Article