-
1
-
-
2142789901
-
Parallel heuristics for the diameter-constrained minimum spanning tree problem
-
Abdalla, A., N. Deo, and R. Fraceschini. (1999). "Parallel Heuristics for the Diameter-Constrained Minimum Spanning Tree Problem." Congressus Numeratium, 136, 97-118.
-
(1999)
Congressus Numeratium
, vol.136
, pp. 97-118
-
-
Abdalla, A.1
Deo, N.2
Fraceschini, R.3
-
2
-
-
2142784823
-
Algorithms for the minimum weight Spanning tree with bounded diameter problem
-
P.K.H. Phua, C.M. Wang, W.Y. Yeong, T.Y. Leong, H.T. Loh, K.C. Tan, and F.S. Chou (eds.). World Scientific Publishing
-
Achuthan, N.R., L. Caccetta, P. Caccetta, and J.F. Geelen. (1992). "Algorithms for the Minimum Weight Spanning Tree with Bounded Diameter Problem." In P.K.H. Phua, C.M. Wang, W.Y. Yeong, T.Y. Leong, H.T. Loh, K.C. Tan, and F.S. Chou (eds.), Optimization: Techniques and Applications, Vol. 1. World Scientific Publishing, pp. 297-304.
-
(1992)
Optimization: Techniques and Applications
, vol.1
, pp. 297-304
-
-
Achuthan, N.R.1
Caccetta, L.2
Caccetta, P.3
Geelen, J.F.4
-
3
-
-
2142679971
-
Computational methods for the diameter restricted minimum weight spanning tree problem
-
Achuthan, N.R., L. Caccetta, P. Caccetta, and J.F. Geelen. (1994). "Computational Methods for the Diameter Restricted Minimum Weight Spanning Tree Problem." Australasian Journal of Combinatorics 10, 51-71.
-
(1994)
Australasian Journal of Combinatorics
, vol.10
, pp. 51-71
-
-
Achuthan, N.R.1
Caccetta, L.2
Caccetta, P.3
Geelen, J.F.4
-
5
-
-
0001276437
-
Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints
-
Gouveia, L. (1998). "Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints." INFORMS Journal on Computing, 10, 180-188.
-
(1998)
INFORMS Journal on Computing
, vol.10
, pp. 180-188
-
-
Gouveia, L.1
-
6
-
-
2142795873
-
Network flow models for designing diameter constrained spanning and steiner trees
-
Gouveia, L. and T. Magnanti. (2003). "Network Flow Models for Designing Diameter Constrained Spanning and Steiner Trees." Networks, 41, 159-173.
-
(2003)
Networks
, vol.41
, pp. 159-173
-
-
Gouveia, L.1
Magnanti, T.2
-
7
-
-
9744253800
-
A 2-path approach for odd-diameter-constrained minimum spanning and steiner trees
-
Gouveia, L, T. Magnanti, and C. Requejo. (2004). "A 2-Path Approach for Odd-Diameter-Constrained Minimum Spanning and Steiner Trees." Networks, 44, 254-265.
-
(2004)
Networks
, vol.44
, pp. 254-265
-
-
Gouveia, L.1
Magnanti, T.2
Requejo, C.3
-
9
-
-
0021376457
-
Network design and transportation planning: Models and algorithms
-
Magnanti, T. and R. Wong. (1984). "Network Design and Transportation Planning: Models and Algorithms." Transportation Science, 18, 1-55.
-
(1984)
Transportation Science
, vol.18
, pp. 1-55
-
-
Magnanti, T.1
Wong, R.2
-
10
-
-
0023849058
-
The design of centralized networks with reliability and availability constraints
-
Woolston, K. and S. Albin. (1988). "The Design of Centralized Networks with Reliability and Availability Constraints." Computers and Operations Research, 15, 207-217.
-
(1988)
Computers and Operations Research
, vol.15
, pp. 207-217
-
-
Woolston, K.1
Albin, S.2
|