{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T15:39:02Z","timestamp":1774539542793,"version":"3.50.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"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":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1109\/tnet.2019.2930231","type":"journal-article","created":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T19:51:41Z","timestamp":1564775501000},"page":"1683-1695","source":"Crossref","is-referenced-by-count":8,"title":["Robust Optimization Framework for Proactive User Association in UDNs: A Data-Driven Approach"],"prefix":"10.1109","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9339-8921","authenticated-orcid":false,"given":"Nikolaos","family":"Liakopoulos","sequence":"first","affiliation":[]},{"given":"Georgios S.","family":"Paschos","sequence":"additional","affiliation":[]},{"given":"Thrasyvoulos","family":"Spyropoulos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2015.7417237"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/90.879343"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195741"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647414"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1125-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2623950"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1038\/sdata.2015.55"},{"key":"ref14","year":"2015","journal-title":"Telecommunications—SMS Call Internet—MI"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.2328143"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/939018.939020"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/IFIPNetworking.2014.6857129"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486303"},{"key":"ref19","author":"naboulsi","year":"2013","journal-title":"Human Mobility Flows in the City of Abidjan"},{"key":"ref28","author":"bertsekas","year":"1995","journal-title":"Nonlinear Programming"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2516538"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"ref3","year":"2016","journal-title":"Ultra-Dense Networks"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2157937"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/070708111"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.145"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8648145"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524624"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2571730"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2013.040413.120676"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6736747"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29854-2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050"},{"key":"ref21","first-page":"850","article-title":"Learning to forget: Continual prediction with LSTM","author":"gers","year":"1999","journal-title":"Proc 9th Int Conf Artif Neural Netw"},{"key":"ref24","article-title":"Projection onto a simplex","author":"chen","year":"2011","journal-title":"arXiv 1101 6081 [math]"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/080734510"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref25","article-title":"Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application","author":"wang","year":"2013","journal-title":"arXiv 1309 1541"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8804282\/08786924.pdf?arnumber=8786924","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:14:52Z","timestamp":1657746892000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8786924\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":32,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2019.2930231","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}