The one-commodity pickup and delivery travelling salesman problem on a path or a tree.
- Published in:
- Networks, 2006, v. 48, n. 1, p. 24, doi. 10.1002/net.20116
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2006 AND VI 48 AND IP 1
Results: 7
1
2
A linear time algorithm for the reverse 1-median problem on a cycle.
- Published in:
- Networks, 2006, v. 48, n. 1, p. 16, doi. 10.1002/net.20115
- By:
- Publication type:
- Article
3
Fault-tolerant routings with minimum optical index.
- Published in:
- Networks, 2006, v. 48, n. 1, p. 47, doi. 10.1002/net.20119
- By:
- Publication type:
- Article
4
Route discovery with constant memory in oriented planar geometric networks.
- Published in:
- Networks, 2006, v. 48, n. 1, p. 7, doi. 10.1002/net.20114
- By:
- Publication type:
- Article
5
Minimum cost flow-dependent communication networks.
- Published in:
- Networks, 2006, v. 48, n. 1, p. 39, doi. 10.1002/net.20118
- By:
- Publication type:
- Article
6
Further contributions to network optimization.
- Published in:
- Networks, 2006, v. 48, n. 1, p. 1, doi. 10.1002/net.20113
- By:
- Publication type:
- Article
7
A simple algorithm that proves half-integrality of bidirected network programming.
- Published in:
- Networks, 2006, v. 48, n. 1, p. 36, doi. 10.1002/net.20117
- By:
- Publication type:
- Article