{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T16:47:40Z","timestamp":1730220460968,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1109\/etfa46521.2020.9212042","type":"proceedings-article","created":{"date-parts":[[2020,10,5]],"date-time":"2020-10-05T21:37:37Z","timestamp":1601933857000},"page":"206-213","source":"Crossref","is-referenced-by-count":1,"title":["Assessment of Different Algorithms to Solve the Set-Covering Problem in a Relay Selection Technique"],"prefix":"10.1109","author":[{"given":"Suelen","family":"Laurindo","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Moraes","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Montez","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Vasques","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/fi10030024"},{"key":"ref11","first-page":"36","article-title":"A Complete Solution to the Set Covering Problem","author":"yang","year":"2015","journal-title":"International Conference on Scientific Computing (CSC)"},{"key":"ref12","first-page":"113","article-title":"Solving the Set Covering Problem Using the Binary Cat Swarm Optimization Metaheuristic","volume":"10","author":"crawford","year":"2016","journal-title":"World Academy of Science Engineering and Technology"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/203032"},{"key":"ref14","first-page":"224","article-title":"A Genetic Algorithm for Minimum Set Covering Problem in Reliable and Efficient Wireless Sensor Networks","volume":"55","author":"bara\u2019a","year":"2014","journal-title":"Iraqi Journal of Science"},{"key":"ref15","first-page":"147","article-title":"A New Genetic Algorithm for the Set Covering Problem","volume":"10","author":"constantino","year":"2010","journal-title":"Varia Scientia"},{"key":"ref16","first-page":"109","article-title":"Restarting a Genetic Algorithm for Set Cover Problem Using Schnabel Census","author":"eremeev","year":"2018","journal-title":"7th International Conference on Optimization Problems and their Applications"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref17"},{"key":"ref18","first-page":"239","article-title":"RSSI is Under Appreciated","author":"srinivasan","year":"2006","journal-title":"3th Workshop on Embedded Networked Sensors (EmNets)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-016-3258-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/9727360"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/WFCS.2015.7160564"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3390\/s16060799"},{"key":"ref8","first-page":"454","article-title":"Optimal Wireless Sensor Networks (WSNs) Deployment: Minimum Cost with Lifetime Constraint","volume":"3","author":"xu","year":"2005","journal-title":"IEEE International Conference on Wireless and Mobile Computing Networking and Communications (WiMob)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3390\/s18103263"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/dac.3508"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-31831-4_12"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TENCONSpring.2018.8692051"},{"journal-title":"Integer Programming","year":"1998","author":"wolsey","key":"ref20"},{"key":"ref22","first-page":"1","article-title":"Improved Greedy Algorithm for Set Covering Problem","volume":"x","author":"chandu","year":"2015","journal-title":"SSRG International Journal of Computer Science and Engineering"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2016.01.005"},{"key":"ref24","first-page":"1","article-title":"Comparing Between Different Approaches to Solve the 0\/1 Knapsack Problem","volume":"16","author":"shaheen","year":"2016","journal-title":"International Journal of Computer Science and Network Security (IJCSNS)"},{"key":"ref23","first-page":"16","article-title":"Solution of Problem of Set Covering by Means of Genetic Algorithm","volume":"46","author":"ananiashvili","year":"2015","journal-title":"Computer Science and Telecommunications"},{"year":"2007","key":"ref25","article-title":"1p solve library"}],"event":{"name":"2020 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","start":{"date-parts":[[2020,9,8]]},"location":"Vienna, Austria","end":{"date-parts":[[2020,9,11]]}},"container-title":["2020 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9210104\/9211869\/09212042.pdf?arnumber=9212042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:44:27Z","timestamp":1656344667000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9212042\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/etfa46521.2020.9212042","relation":{},"subject":[],"published":{"date-parts":[[2020,9]]}}}