Coverage intensity of optimal sensors for common, isolated, and integrated steel structures using novel approach of FEM-MAC-TTFD
Author
Abstract
Suggested Citation
DOI: 10.1177/1550147719857568
Download full text from publisher
References listed on IDEAS
- S. L. Hakimi, 1964. "Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph," Operations Research, INFORMS, vol. 12(3), pages 450-459, June.
- Karabulut, Ezgi & Aras, Necati & Kuban Altınel, İ., 2017. "Optimal sensor deployment to increase the security of the maximal breach path in border surveillance," European Journal of Operational Research, Elsevier, vol. 259(1), pages 19-36.
- Alberto Caprara & Paolo Toth & Matteo Fischetti, 2000. "Algorithms for the Set Covering Problem," Annals of Operations Research, Springer, vol. 98(1), pages 353-371, December.
- Beasley, J. E. & Jornsten, K., 1992. "Enhancing an algorithm for set covering problems," European Journal of Operational Research, Elsevier, vol. 58(2), pages 293-300, April.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
- Nguyen, Tri-Dung, 2014. "A fast approximation algorithm for solving the complete set packing problem," European Journal of Operational Research, Elsevier, vol. 237(1), pages 62-70.
- Scaparra, Maria P. & Church, Richard L., 2008. "An exact solution approach for the interdiction median problem with fortification," European Journal of Operational Research, Elsevier, vol. 189(1), pages 76-92, August.
- Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
- S. Haddadi, 2017. "Benders decomposition for set covering problems," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 60-80, January.
- Andreas M. Tillmann, 2019. "Computing the spark: mixed-integer programming for the (vector) matroid girth problem," Computational Optimization and Applications, Springer, vol. 74(2), pages 387-441, November.
- Gao, Chao & Yao, Xin & Weise, Thomas & Li, Jinlong, 2015. "An efficient local search heuristic with row weighting for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 750-761.
- Alfandari, Laurent, 2004. "Choice Rules with Size Constraints for Multiple Criteria Decision Making," ESSEC Working Papers DR 04002, ESSEC Research Center, ESSEC Business School.
- S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.
- M Horn, 1996. "Analysis and Computational Schemes for p-Median Heuristics," Environment and Planning A, , vol. 28(9), pages 1699-1708, September.
- Daoqin Tong & Alan T. Murray, 2009. "Maximising coverage of spatial demand for service," Papers in Regional Science, Wiley Blackwell, vol. 88(1), pages 85-97, March.
- Schnepper, Teresa & Klamroth, Kathrin & Stiglmayr, Michael & Puerto, Justo, 2019. "Exact algorithms for handling outliers in center location problems on networks using k-max functions," European Journal of Operational Research, Elsevier, vol. 273(2), pages 441-451.
- Davood Shishebori & Lawrence Snyder & Mohammad Jabalameli, 2014. "A Reliable Budget-Constrained FL/ND Problem with Unreliable Facilities," Networks and Spatial Economics, Springer, vol. 14(3), pages 549-580, December.
- P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
- Behrens, Kristian, 2007.
"On the location and lock-in of cities: Geography vs transportation technology,"
Regional Science and Urban Economics, Elsevier, vol. 37(1), pages 22-45, January.
- BEHRENS, Kristian, 2004. "On the location and ‘lock-in’ of cities : geography vs. transportation technology," LIDAM Discussion Papers CORE 2004044, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- BEHRENS, Kristian, 2007. "On the location and lock-in of cities: geography vs transportation technology," LIDAM Reprints CORE 1948, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Jiwon Baik & Alan T. Murray, 2022. "Locating a facility to simultaneously address access and coverage goals," Papers in Regional Science, Wiley Blackwell, vol. 101(5), pages 1199-1217, October.
- Csiszár, Csaba & Csonka, Bálint & Földes, Dávid & Wirth, Ervin & Lovas, Tamás, 2020. "Location optimisation method for fast-charging stations along national roads," Journal of Transport Geography, Elsevier, vol. 88(C).
- Ashraf Abd El Karim & Mohsen M. Awawdeh, 2020. "Integrating GIS Accessibility and Location-Allocation Models with Multicriteria Decision Analysis for Evaluating Quality of Life in Buraidah City, KSA," Sustainability, MDPI, vol. 12(4), pages 1-28, February.
- Zvi Drezner & G. O. Wesolowsky, 1991. "Facility location when demand is time dependent," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 763-777, October.
- Zhizhu Lai & Qun Yue & Zheng Wang & Dongmei Ge & Yulong Chen & Zhihong Zhou, 2022. "The min-p robust optimization approach for facility location problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1134-1160, September.
More about this item
Keywords
Optimal sensor placement; modal assurance criterion; nonlinear time history analysis; transformed time history to frequency domain; coverage intensity;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:15:y:2019:i:8:p:1550147719857568. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.