Nonexistence of optimal graphs for all terminal reliability.
- Published in:
- Networks, 2014, v. 63, n. 2, p. 146, doi. 10.1002/net.21530
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2014 AND VI 63 AND IP 2
Results: 8
1
2
Complexity and approximability of the k-way vertex cut.
- Published in:
- Networks, 2014, v. 63, n. 2, p. 170, doi. 10.1002/net.21534
- By:
- Publication type:
- Article
3
Revisiting deadlock prevention: A probabilistic approach.
- Published in:
- Networks, 2014, v. 63, n. 2, p. 203, doi. 10.1002/net.21537
- By:
- Publication type:
- Article
4
Network analysis for active and passive propagation models.
- Published in:
- Networks, 2014, v. 63, n. 2, p. 160, doi. 10.1002/net.21532
- By:
- Publication type:
- Article
5
Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results.
- Published in:
- Networks, 2014, v. 63, n. 2, p. 196, doi. 10.1002/net.21536
- By:
- Publication type:
- Article
6
Incomplete service and split deliveries in a routing problem with profits.
- Published in:
- Networks, 2014, v. 63, n. 2, p. 135, doi. 10.1002/net.21529
- By:
- Publication type:
- Article
7
Minisum multipurpose trip location problem on trees.
- Published in:
- Networks, 2014, v. 63, n. 2, p. 154, doi. 10.1002/net.21531
- By:
- Publication type:
- Article
8
An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree.
- Published in:
- Networks, 2014, v. 63, n. 2, p. 179, doi. 10.1002/net.21535
- By:
- Publication type:
- Article