A branch and bound algorithm for the capacitated minimum spanning tree problem.
- Published in:
- Networks, 1993, v. 23, n. 6, p. 525, doi. 10.1002/net.3230230603
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1993 AND VI 23 AND IP 6
Results: 7
1
2
Finding minimum cost to time ratio cycles with small integral transit times.
- Published in:
- Networks, 1993, v. 23, n. 6, p. 567, doi. 10.1002/net.3230230607
- By:
- Publication type:
- Article
3
Optimal multifacility defensive location on planes with rectilinear distances.
- Published in:
- Networks, 1993, v. 23, n. 6, p. 517, doi. 10.1002/net.3230230602
- By:
- Publication type:
- Article
4
A differential game model of Nash equilibrium on a congested traffic network.
- Published in:
- Networks, 1993, v. 23, n. 6, p. 557, doi. 10.1002/net.3230230606
- By:
- Publication type:
- Article
5
Masthead.
- Published in:
- Networks, 1993, v. 23, n. 6, p. fmi, doi. 10.1002/net.3230230601
- Publication type:
- Article
6
On locating path- or tree-shaped facilities on networks.
- Published in:
- Networks, 1993, v. 23, n. 6, p. 543, doi. 10.1002/net.3230230605
- By:
- Publication type:
- Article
7
Finding all minimum-size separating vertex sets in a graph.
- Published in:
- Networks, 1993, v. 23, n. 6, p. 533, doi. 10.1002/net.3230230604
- By:
- Publication type:
- Article