{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:45:00Z","timestamp":1740138300783,"version":"3.37.3"},"reference-count":40,"publisher":"Informa UK Limited","issue":"4","funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["18\u201371\u201300084"],"award-info":[{"award-number":["18\u201371\u201300084"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003182","name":"SB RAS -Siberian Branch, Russian Academy of Sciences","doi-asserted-by":"publisher","award":["0314\u20132019\u20130014"],"award-info":[{"award-number":["0314\u20132019\u20130014"]}],"id":[{"id":"10.13039\/501100003182","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2021,7,4]]},"DOI":"10.1080\/10556788.2019.1710836","type":"journal-article","created":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T08:37:27Z","timestamp":1578472647000},"page":"697-719","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":3,"title":["GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN"],"prefix":"10.1080","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2038-5609","authenticated-orcid":false,"given":"Roman","family":"Plotnikov","sequence":"first","affiliation":[{"name":"Sobolev Institute of Mathematics, Novosibirsk, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2183-523X","authenticated-orcid":false,"given":"Adil","family":"Erzin","sequence":"additional","affiliation":[{"name":"Sobolev Institute of Mathematics, Novosibirsk, Russia"},{"name":"Novosibirsk State University, Novosibirsk, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1432-8560","authenticated-orcid":false,"given":"Vyacheslav","family":"Zalyubovskiy","sequence":"additional","affiliation":[{"name":"Sobolev Institute of Mathematics, Novosibirsk, Russia"}]}],"member":"301","published-online":{"date-parts":[[2020,1,8]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.3923\/jas.2013.883.888"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2014.031914.00029"},{"key":"CIT0003","unstructured":"R. Beier and J.F. Sibeyn, A Powerful Heuristic for Telephone Gossiping, Proceedings of 17th International Colloquium on Structural Information & Communication Complexity (SIROCCO 2000), 2000, pp.\u00a017\u201336."},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/11599463_14"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90358-O"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2013.06.004"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2019.2899604"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.032"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1109\/CSNDSP.2016.7574007"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015013919497"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144185"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1109\/CTRQ.2009.33"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00100-4"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011336210885"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.50"},{"key":"CIT0018","first-page":"87","volume":"2","author":"Hussain S.","year":"2007","journal-title":"J. Netw."},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.22"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.3390\/s18041020"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1016\/j.eij.2018.01.002"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-801950-4.00006-8"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.7763\/IJMLC.2011.V1.12"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-010-0282-y"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2011.6133827"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-016-1337-5"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2018.0876"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2017.12.003"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44914-2_18"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-10934-9_16"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1051\/matecconf\/201712503001"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73190-0"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-014-0853-4"},{"key":"CIT0034","unstructured":"N. Sudha, M.L. Valarmathi, and T.C. Neyandar, Optimizing Energy in WSN Using Evolutionary Algorithm, Proceeding of IJCA on International Conference on VLSI, Communications and Instrumentation (ICVCI 2011), Kerala, India, 7\u20139 April 2011, 2011, pp.\u00a026\u201329."},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2011.2162086"},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijdrr.2018.04.004"},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2010.95"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2010.10.008"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1007\/s11424-008-9139-1"},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.3390\/jsan2040675"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2019.1710836","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T12:12:58Z","timestamp":1662379978000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2019.1710836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,8]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7,4]]}},"alternative-id":["10.1080\/10556788.2019.1710836"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2019.1710836","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2020,1,8]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-01-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-01-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}