Locating a surveillance infrastructure in and near ports or on other planar surfaces to monitor flows

Computer-Aided Civil and Infrastructure Engineering

Volumn 25, Issue 2, 2010, Pages 89-100

  Mirchandani, Pitu B ^a   Li, Jing Quan ^b   Long, Yejuan ^c  

^a ARIZONA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HOME LAND SECURITY; LAGRANGIAN HEURISTICS; LOCATION PROBLEMS; MAXIMAL COVERING PROBLEMS; PLANAR SURFACE; RADAR LOCATIONS; RADAR SIGNALS; SECURITY ISSUES; SET-COVERING MODEL; TARGET SURFACE; TRAFFIC MANAGERS; TWO STAGE;

LOCATION; NETWORK SECURITY; SURVEILLANCE RADAR; TARGETS;

RADAR;

HEURISTICS; LAGRANGIAN ANALYSIS; MONITORING; NUMERICAL MODEL; PLANNING METHOD; RADAR; TRAFFIC MANAGEMENT; TRANSPORTATION INFRASTRUCTURE; TRANSPORTATION PLANNING;

EID: 73949127121     PISSN: 10939687     EISSN: 14678667     Source Type: Journal    
DOI: 10.1111/j.1467-8667.2009.00623.x     Document Type: Article

References (28)

1. Agnetis A, Grande E, Mirchandani P B, Pacifici A. Covering a line segment with variable radius discs. Computers and Operations Research 2008, 36:1423-36.
2. Alt H, Arkin E M, Brönnimann H, Erickson J, Fekete S P, Knauer C, Lenchner J, Mitchell J S B, Whittlesey K. Minimum-cost coverage of point sets by disks. 2006, 449-58. June, ACM Press, New York
3. Balas E, Ho A. Set covering algorithms using cutting planes, heuristics, and subgradient optimization-a computational study. Mathematical Programming Study 1980, 12:37-60.
4. Brearley A L, Mitra G, Williams H P. Analysis of mathematical programming problems prior to applying the simplex algorithm. Mathematical Programming 1975, 8:54-83.
5. Brönnimann H, Goodrich M T. Almost optimal set covers in finite VC dimension. Discrete and Computational Geometry 1995, 14(4):463-79.
6. Caprara A, Fischetti M, Toth P. A heuristic method for the set covering problem. Operations Research 1999, 47:730-43.
7. Chazelle B, Lee D. On a circle placement problem. Computing 1986, 36:1-16.
8. Church R L, Meadows M. Location modeling utilizing maximum service distance criteria. Geographical Analysis 1979, 11:358-79.
9. Chvatal V. A combinatorial theorem in plane geometry. Journal of Combinatorial Theory 1975, 18:39-41.
10. Daskin M S. A maximum expected covering location model: formulation, properties and heuristic solution. Transportation Science 1983, 17:48-70.
11. Daskin M S. Network and Discrete Location: Models, Algorithms, and Applications 1995, John Wiley and Sons, New York
12. Small vessel security strategy. 2008, http://www.dhs.gov/xlibrary/assets/small-vessel-security-strategy.pdf, Department of Homeland Security, (accessed on Sept. 6, 2008)
13. Drezner Z. On a modified one-center problem. Management Science 1981, 27:227-30.
14. Drezner Z. P-cover problem. European Journal of Operational Research 1986, 26:312-13.
15. Drezner Z, Hamacher H W. Facility Location: Applications and Theory 2002, Springer-Verlag, New York
16. Fisher M L, Kedian P. Optimal solution of set covering partitioning problem using dual heuristic. Management Science 1990, 36:674-88.
17. Francis R L, McGinnis L F, White J A. Facility Layout and Location: An Analytical Approach 1992, 2nd edn, Prentice Hall, Englewood Cliffs, NJ
18. Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness 1979, W. H. Freeman
19. Gentili M, Mirchandani P B. Locating active sensors on traffic networks. Annals of Operations Research 2005, 136:229-57.
20. Gentili M, Mirchandani P B. Locating sensors on traffic network: an overview. 2008, June 26-July 1, 2008, Santa Barbara, CA
21. Ghosh A, Rushton G. Spatial Analysis and Location-Allocation Models 1987, Van Nostrand Reinhold, New York
22. Held M, Karp R M. The traveling salesman problem and minimum spanning trees: Part II. Mathematical Programming 1971, 1:6-25.
23. Hochbaum D S, Maass M. Approximation schemes for covering and packing problems in image-processing and VLSI. Journal of ACM 1985, 32:130-36.
24. Hoffman K L, Padberg M. LP-based combinatorial problem solving. Annals of Operations Research 1991, 4:145-94.
25. Huang C F, Tseng Y C. The coverage problem in a wireless sensor network. Journal of Internet Technology 2005, 6:1-8.
26. Lazos L, Poovendran R. Stochastic coverage in heterogeneous wireless sensor networks. ACM Transactions on Sensor Networks 2006, 8:325-58.
27. Mirchandani P B, Francis R L. Discrete Location Theory 1990, Wiley and Sons
28. Xing G L, Wang X R, Zhang Y F, Lu C, Pless R, Gill C. Integrated coverage and connectivity configuration for energy conservation in sensor networks. Transport Sensor Networks 2005, 1:36-72.