Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem.
- Published in:
- Networks, 2009, v. 53, n. 4, p. 358, doi. 10.1002/net.20292
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2009 AND VI 53 AND IP 4
Results: 7
1
2
Lower bounding techniques for the degree-constrained network design problem.
- Published in:
- Networks, 2009, v. 53, n. 4, p. 334, doi. 10.1002/net.20287
- By:
- Publication type:
- Article
3
Approximating the smallest k-edge connected spanning subgraph by LP-rounding.
- Published in:
- Networks, 2009, v. 53, n. 4, p. 345, doi. 10.1002/net.20289
- By:
- Publication type:
- Article
4
Searching symmetric networks with Utilitarian-Postman paths.
- Published in:
- Networks, 2009, v. 53, n. 4, p. 392, doi. 10.1002/net.20314
- By:
- Publication type:
- Article
5
Cost-effective designs of fault-tolerant access networks in communication systems.
- Published in:
- Networks, 2009, v. 53, n. 4, p. 382, doi. 10.1002/net.20306
- By:
- Publication type:
- Article
6
The forwarding indices of wrapped butterfly networks.
- Published in:
- Networks, 2009, v. 53, n. 4, p. 329, doi. 10.1002/net.20271
- By:
- Publication type:
- Article
7
New largest known graphs of diameter 6.
- Published in:
- Networks, 2009, v. 53, n. 4, p. 315, doi. 10.1002/net.20269
- By:
- Publication type:
- Article