A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem.
- Published in:
- Networks, 1997, v. 29, n. 3, p. 161, doi. 10.1002/(SICI)1097-0037(199705)29:3<161::AID-NET4>3.0.CO;2-F
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1997 AND VI 29 AND IP 3
Results: 5
1
2
Minimum-weight cycles in 3-separable graphs.
- Published in:
- Networks, 1997, v. 29, n. 3, p. 151, doi. 10.1002/(SICI)1097-0037(199705)29:3<151::AID-NET3>3.0.CO;2-G
- By:
- Publication type:
- Article
3
Time-varying shortest path problems with constraints.
- Published in:
- Networks, 1997, v. 29, n. 3, p. 141, doi. 10.1002/(SICI)1097-0037(199705)29:3<141::AID-NET2>3.0.CO;2-H
- By:
- Publication type:
- Article
4
Minimum bandwidth problem for embedding graphs in cycles.
- Published in:
- Networks, 1997, v. 29, n. 3, p. 135, doi. 10.1002/(SICI)1097-0037(199705)29:3<135::AID-NET1>3.0.CO;2-I
- By:
- Publication type:
- Article
5
A GRASP for graph planarization.
- Published in:
- Networks, 1997, v. 29, n. 3, p. 173, doi. 10.1002/(SICI)1097-0037(199705)29:3<173::AID-NET5>3.0.CO;2-E
- By:
- Publication type:
- Article