{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:16Z","timestamp":1740099616626,"version":"3.37.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030386283"},{"type":"electronic","value":"9783030386290"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38629-0_29","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:05:05Z","timestamp":1579597505000},"page":"355-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2038-5609","authenticated-orcid":false,"given":"Roman","family":"Plotnikov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2183-523X","authenticated-orcid":false,"given":"Adil","family":"Erzin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"29_CR1","volume-title":"Wireless Communications: Principles and Practices","author":"TS Rappaport","year":"1996","unstructured":"Rappaport, T.S.: Wireless Communications: Principles and Practices. Prentice Hall, Upper Saddle River (1996)"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-48413-4_21","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"AEF Clementi","year":"1999","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: Hardness results for the power range assignment problem in packet radio networks. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) APPROX\/RANDOM -1999. LNCS, vol. 1671, pp. 197\u2013208. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/978-3-540-48413-4_21"},{"issue":"1\u20132","key":"29_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"LM Kirousis","year":"2000","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoret. Comput. Sci. 243(1\u20132), 289\u2013305 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR4","series-title":"IFIP \u2014 The International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-0-387-35608-2_11","volume-title":"Foundations of Information Technology in the Era of Network and Mobile Computing","author":"G C\u0103linescu","year":"2002","unstructured":"C\u0103linescu, G., M\u0103ndoiu, I.I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds.) Foundations of Information Technology in the Era of Network and Mobile Computing. ITIFIP, vol. 96, pp. 119\u2013130. Springer, Boston, MA (2002). \nhttps:\/\/doi.org\/10.1007\/978-0-387-35608-2_11"},{"issue":"3","key":"29_CR5","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/TMC.2003.1233530","volume":"2","author":"X Cheng","year":"2003","unstructured":"Cheng, X., Narahari, B., Simha, R., Cheng, M.X., Liu, D.: Strong minimum energy topology in wireless sensor networks: NP-completeness and heuristics. IEEE Trans. Mob. Comput. 2(3), 248\u2013256 (2003)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"29_CR6","unstructured":"Chu, T., Nikolaidis, I.: Energy efficient broadcast in mobile ad hoc networks. In: Proceedings of AD-HOC Networks and Wireless (2002)"},{"key":"29_CR7","unstructured":"Park, J., Sahni, S.: Power assignment for symmetric communication in wireless networks. In: Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC), Washington, pp. 591\u2013596. IEEE Computer Society, Los Alamitos (2006)"},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s11276-005-5275-x","volume":"12","author":"E Althaus","year":"2006","unstructured":"Althaus, E., Calinescu, G., Mandoiu, I.I., Prasad, S.K., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks. Wireless Netw. 12(3), 287\u2013299 (2006)","journal-title":"Wireless Netw."},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1134\/S1990478913020038","volume":"7","author":"A Erzin","year":"2013","unstructured":"Erzin, A., Plotnikov, R., Shamardin, Y.: On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem. J. Appl. Ind. Math. 7, 142\u2013152 (2013)","journal-title":"J. Appl. Ind. Math."},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-01009-5_17","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"S Wolf","year":"2009","unstructured":"Wolf, S., Merz, P.: Iterated local search for minimum power symmetric connectivity in wireless networks. In: Cotta, C., Cowling, P. (eds.) EvoCOP 2009. LNCS, vol. 5482, pp. 192\u2013203. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-01009-5_17"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.endm.2014.11.004","volume":"47","author":"A Erzin","year":"2015","unstructured":"Erzin, A., Plotnikov, R.: Using VNS for the optimal synthesis of the communication tree in wireless sensor networks. Electron. Notes Discret. Math. 47, 21\u201328 (2015)","journal-title":"Electron. Notes Discret. Math."},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.cor.2016.05.010","volume":"78","author":"A Erzin","year":"2017","unstructured":"Erzin, A., Mladenovic, N., Plotnikov, R.: Variable neighborhood search variants for Min-power symmetric connectivity problem. Comput. Oper. Res. 78, 557\u2013563 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"29_CR13","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1007\/s11590-018-1324-0","volume":"13","author":"A Erzin","year":"2019","unstructured":"Erzin, A., Plotnikov, R., Mladenovic, N.: VNDS for Min-power symmetric connectivity problem. Optim. Lett. 13(8), 1897\u20131911 (2019). \nhttps:\/\/doi.org\/10.1007\/s11590-018-1324-0","journal-title":"Optim. Lett."},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-45253-2_14","volume-title":"Algorithms - ESA 2000","author":"AEF Clementi","year":"2000","unstructured":"Clementi, A.E.F., Ferreira, A., Penna, P., Perennes, S., Silvestri, R.: The minimum range assignment problem on linear radio networks. In: Paterson, M.S. (ed.) ESA 2000. LNCS, vol. 1879, pp. 143\u2013154. Springer, Heidelberg (2000). \nhttps:\/\/doi.org\/10.1007\/3-540-45253-2_14"},{"issue":"9","key":"29_CR15","doi-asserted-by":"publisher","first-page":"1358","DOI":"10.1016\/j.dam.2005.05.034","volume":"154","author":"G Calinescu","year":"2006","unstructured":"Calinescu, G., Kapoor, S., Sarwat, M.: Bounded-hops power assignment in ad hoc wireless networks. Discret. Appl. Math. 154(9), 1358\u20131371 (2006)","journal-title":"Discret. Appl. Math."},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-319-21840-3_12","volume-title":"Algorithms and Data Structures","author":"P Carmi","year":"2015","unstructured":"Carmi, P., Chaitman-Yerushalmi, L., Trabelsi, O.: On the bounded-hop range assignment problem. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 140\u2013151. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21840-3_12"},{"key":"29_CR17","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Electronic Colloquium on Computational Complexity (ECCC) (054) (2000)"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-030-33394-2_31","volume-title":"Mathematical Optimization Theory and Operations Research","author":"Roman Plotnikov","year":"2019","unstructured":"Plotnikov, R., Erzin, A.: Constructive heuristics for min-power bounded-hops symmetric connectivity problem. In: CCIS, vol. 1090, pp. 390\u2013407 (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-33394-2_31"},{"key":"29_CR19","doi-asserted-by":"publisher","unstructured":"Gruber, M., van Hemert, J., Raidl, G.R.: Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. In: Proceedings of 8th Annual Conference on Genetic and Evolutionary Computation (GECCO 2006), Seattle, Washington, USA, 08\u201312 July, pp. 1187\u20131194 (2006). \nhttps:\/\/doi.org\/10.1145\/1143997.1144185","DOI":"10.1145\/1143997.1144185"},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38629-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:21:49Z","timestamp":1579598509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38629-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030386283","9783030386290"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38629-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chania, Crete","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion13.pem.tuc.gr\/en\/home\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}