Found: 7
Select item for more details and to access through your institution.
Clustering for faster network simplex pivots.
- Published in:
- Networks, 2000, v. 35, n. 3, p. 173, doi. 10.1002/(SICI)1097-0037(200005)35:3<173::AID-NET1>3.0.CO;2-W
- By:
- Publication type:
- Article
Robust path choice in networks with failures.
- Published in:
- Networks, 2000, v. 35, n. 3, p. 181, doi. 10.1002/(SICI)1097-0037(200005)35:3<181::AID-NET2>3.0.CO;2-Y
- By:
- Publication type:
- Article
The searchlight guarding problem on weighted split graphs and weighted cographs.
- Published in:
- Networks, 2000, v. 35, n. 3, p. 195, doi. 10.1002/(SICI)1097-0037(200005)35:3<195::AID-NET3>3.0.CO;2-I
- By:
- Publication type:
- Article
Shortest path routing and fault-tolerant routing on de Bruijn networks.
- Published in:
- Networks, 2000, v. 35, n. 3, p. 207, doi. 10.1002/(SICI)1097-0037(200005)35:3<207::AID-NET4>3.0.CO;2-F
- By:
- Publication type:
- Article
Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems.
- Published in:
- Networks, 2000, v. 35, n. 3, p. 216, doi. 10.1002/(SICI)1097-0037(200005)35:3<216::AID-NET5>3.0.CO;2-E
- By:
- Publication type:
- Article
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem.
- Published in:
- Networks, 2000, v. 35, n. 3, p. 223, doi. 10.1002/(SICI)1097-0037(200005)35:3<223::AID-NET6>3.0.CO;2-J
- By:
- Publication type:
- Article
Construction schemes for fault-tolerant Hamiltonian graphs.
- Published in:
- Networks, 2000, v. 35, n. 3, p. 233, doi. 10.1002/(SICI)1097-0037(200005)35:3<233::AID-NET7>3.0.CO;2-F
- By:
- Publication type:
- Article