A catalog of Hanan grid problems.
- Published in:
- Networks, 2001, v. 38, n. 2, p. 76, doi. 10.1002/net.1026
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2001 AND VI 38 AND IP 2
Results: 6
1
2
A polynomial algorithm for a constrained traveling salesman problem.
- Published in:
- Networks, 2001, v. 38, n. 2, p. 68, doi. 10.1002/net.1025
- By:
- Publication type:
- Article
3
Robust location problems with pos/neg weights on a tree.
- Published in:
- Networks, 2001, v. 38, n. 2, p. 102, doi. 10.1002/net.1029
- By:
- Publication type:
- Article
4
On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality.
- Published in:
- Networks, 2001, v. 38, n. 2, p. 59, doi. 10.1002/net.1024
- By:
- Publication type:
- Article
5
Solving the minimum-weighted coloring problem.
- Published in:
- Networks, 2001, v. 38, n. 2, p. 88, doi. 10.1002/net.1028
- By:
- Publication type:
- Article
6
The center function on trees.
- Published in:
- Networks, 2001, v. 38, n. 2, p. 84, doi. 10.1002/net.1027
- By:
- Publication type:
- Article