A note on the location of an obnoxious facility on a network
- 1 January 2000
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 120 (1) , 215-217
- https://doi.org/10.1016/s0377-2217(98)00237-9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Analytical models for locating undesirable facilitiesPublished by Elsevier ,2011
- Finite Dominating Sets for Network Location ProblemsOperations Research, 1991
- Locating an obnoxious facility within a polygonal regionAnnals of Operations Research, 1986
- Location of Multiple Obnoxious FacilitiesTransportation Science, 1985
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- THE LOCATION OF AN OBNOXIOUS FACILITY WITH RECTANGULAR DISTANCES*Journal of Regional Science, 1983
- Locating an Obnoxious Facility on a NetworkTransportation Science, 1978
- Closest-point problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Algorithm 97: Shortest pathCommunications of the ACM, 1962