The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms.
- Published in:
- Networks, 2007, v. 50, n. 4, p. 258, doi. 10.1002/net.20209
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2007 AND VI 50 AND IP 4
Results: 5
1
2
A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs.
- Published in:
- Networks, 2007, v. 50, n. 4, p. 231, doi. 10.1002/net.20200
- By:
- Publication type:
- Article
3
Large vertex symmetric digraphs.
- Published in:
- Networks, 2007, v. 50, n. 4, p. 241, doi. 10.1002/net.20201
- By:
- Publication type:
- Article
4
Majorization and distances in trees.
- Published in:
- Networks, 2007, v. 50, n. 4, p. 251, doi. 10.1002/net.20202
- By:
- Publication type:
- Article
5
Approximability of the k-server disconnection problem.
- Published in:
- Networks, 2007, v. 50, n. 4, p. 273, doi. 10.1002/net.20203
- By:
- Publication type:
- Article