Found: 4
Select item for more details and to access through your institution.
The k best spanning arborescences of a network.
- Published in:
- Networks, 1980, v. 10, n. 2, p. 91, doi. 10.1002/net.3230100202
- By:
- Publication type:
- Article
A note on finding optimum branchings.
- Published in:
- Networks, 1979, v. 9, n. 4, p. 309, doi. 10.1002/net.3230090403
- By:
- Publication type:
- Article
THE IMAGE OF WEIGHTED COMBINATORIAL PROBLEMS.
- Published in:
- Annals of Operations Research, 1991, v. 33, n. 1-4, p. 181, doi. 10.1007/BF02115754
- By:
- Publication type:
- Article
ALGORITHMS FOR FINDING OPTIMUM TREES: DESCRIPTION, USE AND EVALUATION.
- Published in:
- Annals of Operations Research, 1988, v. 13, n. 1-4, p. 265, doi. 10.1007/BF02288325
- By:
- Publication type:
- Article