Optimal placement of stereo sensors

Optimization Letters

Volumn 2, Issue 1, 2008, Pages 99-111

  Al Hasan, Mohammad ^a   Ramachandran, Krishna K ^a   Mitchell, John E ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Branch and cut; GRASP; Integer programming; Sensors

Indexed keywords

CAMERAS; COST EFFECTIVENESS; INTEGER PROGRAMMING; PROBLEM SOLVING; SPACE SURVEILLANCE; WIRELESS SENSOR NETWORKS;

BRANCH-AND-CUT; DISSEMINATE INFORMATION; SENSOR NODES; STEREO SENSORS; WIRELESS DEVICES;

SENSORS;

EID: 35448955737     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-007-0046-5     Document Type: Article

References (17)

1. Aiex R.M., Pardalos P.M., Resende M.G.C. and Toraldo G. (2005). GRASP with path-relinking for three-index assignment. INFORMS J. Comput. 17(2): 224-247
2. Akyildiz I.F., Su W., Sankarasubramaniam Y. and Cayirci E. (2002). A survey on sensor networks. IEEE Commun. Mag. 40(8): 102-114
3. Bredin, J.L., Demaine, E.D., Hajiaghayi, M.T., Rus, D.: Deploying sensor networks with guaranteed capacity and fault tolerance. In: Proceedings of the 6th ACM International Symposium on Mobile ad hoc Networking and Computing MobiHoc '05, pp. 309-319 (2005)
4. Chvátal V. (1973). Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4: 305-337
5. Edmonds J. (1965). Maximum matching and a polyhedron with 0, 1 vertices. J. Res Nat Bureau Stand. 69: 125-130
6. Feo T.A. and Resende M.G.C. (1995). Greedy randomized adaptive search procedures. J. Global Optim. 6: 109-133
7. Grundel D., Oliveira C.A.S. and Pardalos P.M. (2004). Asymptotic properties of random multidimensional assignment problems. J. Optim. Theory Appl. 122(3): 487-500
8. Isler V., Khanna S., Spletzer J. and Taylor C.J. (2005). Target tracking with distributed sensors: the focus of attention problem. Comput. Vis Image Understand. J. 100(1-2): 225-247
9. Johnsson M., Magyar G. and Nevalainen O. (1998). On the Euclidean 3-matching problem. Nordic J. Comput. 5(2): 143-171
10. Li, Y., Pardalos, P.M., Resende, M.G.C.: A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos, P. M., Wolkowicz, H. (eds.) Quadratic assignment and related problems, vol. 16 ofDIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 237-261. American Mathematical Society (1994)
11. Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.S.: Algorithmic aspects of topology control problems for ad hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile ad hoc Networking and Computing, pp. 123-134 (2002)
12. Pitsoulis L.S. and Resende M.G.C. (2002). Greedy randomized adaptive search procedures. In: Pardalos, P.M. and Resende, M.G.C. (eds) Handbook of Applied Optimization, pp 168-183. Oxford University Press, Oxford
13. Rentala P., Musunuri R., Gandham S., Saxena U. (2003) Survey of sensor networks. Technical Report UTDCS-10-03, Department of Computer Science. University of Texas at Dallas, Richardson
14. Resende M.G.C. and Ribeiro C.C. (2002). Greedy radomized adaptive search procedures. In: Glover, F. and Kochenberger, G. (eds) Handbook of Metaheuristics, pp 219-249. Kluwer, Dordrecht
15. Resende M.G.C and Ribeiro C.C. (2005). GRASP with path relinking: recent advances and applications. In: Ibaraki, T., Nonobe, K. and Yagiura, M. (eds) Metaheuristics: Progress as Real Problem Solvers, pp 301-331. Springer, Berlin
16. Tilak S., Abu-Ghazaleh N. and Heinzelman W. (2002). A taxonomy of wireless micro-sensor network models. ACM Mobile Comput. Commun. Rev. (MC2R) 6(2): 28-36
17. Tubaishat M. and Madria S. (2003). Sensor networks: an overview. IEEE Potent. 22(2): 20-23