Locating an obnoxious facility on a euclidean network to minimize neighborhood damage.
- Published in:
- Networks, 1994, v. 24, n. 1, p. 1, doi. 10.1002/net.3230240102
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1994 AND VI 24 AND IP 1
Results: 6
1
2
Use of continuous approximations within discrete algorithms for routing vehicles: Experimental results and interpretation.
- Published in:
- Networks, 1994, v. 24, n. 1, p. 43, doi. 10.1002/net.3230240106
- By:
- Publication type:
- Article
3
Masthead.
- Published in:
- Networks, 1994, v. 24, n. 1, p. fmi, doi. 10.1002/net.3230240101
- Publication type:
- Article
4
Improving the location of minimax facilities through network modification.
- Published in:
- Networks, 1994, v. 24, n. 1, p. 31, doi. 10.1002/net.3230240105
- By:
- Publication type:
- Article
5
A new characterization of tree medians with applications to distributed sorting.
- Published in:
- Networks, 1994, v. 24, n. 1, p. 23, doi. 10.1002/net.3230240104
- By:
- Publication type:
- Article
6
Weighted k-cardinality trees: Complexity and polyhedral structure.
- Published in:
- Networks, 1994, v. 24, n. 1, p. 11, doi. 10.1002/net.3230240103
- By:
- Publication type:
- Article