A polynomial-time algorithm to find shortest paths with recourse.
- Published in:
- Networks, 2003, v. 41, n. 2, p. 115, doi. 10.1002/net.10063
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2003 AND VI 41 AND IP 2
Results: 6
1
2
An improved algorithm for the minmax regret median problem on a tree.
- Published in:
- Networks, 2003, v. 41, n. 2, p. 97, doi. 10.1002/net.10062
- By:
- Publication type:
- Article
3
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3.
- Published in:
- Networks, 2003, v. 41, n. 2, p. 83, doi. 10.1002/net.10061
- By:
- Publication type:
- Article
4
A GRASP with path-relinking for private virtual circuit routing.
- Published in:
- Networks, 2003, v. 41, n. 2, p. 104, doi. 10.1002/net.10065
- By:
- Publication type:
- Article
5
Towards minimum k-geodetically connected graphs.
- Published in:
- Networks, 2003, v. 41, n. 2, p. 73, doi. 10.1002/net.10060
- By:
- Publication type:
- Article
6
Reserving resilient capacity for a single commodity with upper-bound constraints.
- Published in:
- Networks, 2003, v. 41, n. 2, p. 87, doi. 10.1002/net.10064
- By:
- Publication type:
- Article