{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T06:31:16Z","timestamp":1679985076414},"reference-count":27,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2017,9,7]]},"published-print":{"date-parts":[[2019,7]]},"abstract":"This paper addresses the problem of allocating the terminal nodes to the hub nodes in a telecommunication network. Since the flow processing induces some undesirable delay, the objective is to minimize the total flow processed by the hubs. This study focuses on a real life network of the tunisian operator Tunisie Telecom<\/jats:italic> whose operations managers are concerned by the quality of service. We provide three compact formulations that give optimal solutions for networks of large size. In particular, the last two are obtained by applying the Reformulation-Linearization Technique to a nonlinear formulation of the problem. The latter formulation derived within this approach is the most computationally effective, as pointed out by the computational experiments conducted on the real life network of Tunisie Telecom<\/jats:italic> with 110 nodes and 5 hubs. Finally, we discuss and compare between the single allocation and double allocation configurations.<\/jats:p>","DOI":"10.1051\/ro\/2017065","type":"journal-article","created":{"date-parts":[[2017,9,11]],"date-time":"2017-09-11T06:40:35Z","timestamp":1505112035000},"page":"807-827","source":"Crossref","is-referenced-by-count":1,"title":["Allocating nodes to hubs for minimizing the hubs processing resources: A case study"],"prefix":"10.1051","volume":"53","author":[{"given":"Ali","family":"Balma","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Mrad","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/net.20486","volume":"59","author":"Addis","year":"2012","journal-title":"Networks"},{"key":"R2","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.omega.2012.02.005","volume":"40","author":"Alumur Sibel","year":"2012","journal-title":"Omega"},{"key":"R3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"Alumur","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"R4","unstructured":"Balma A., Hadj\u2013Alouane A.B. and Ben Hadj-Alouane N., Optimizing voice processing resources of the Trunk Gateways in NGN networks. In: Proc. of International Multi-Conference on Complexity, Informatics and Cybernetics: IMCIC 2014 (2014) 152\u2013155."},{"key":"R5","doi-asserted-by":"crossref","first-page":"1477","DOI":"10.1287\/opre.1110.0965","volume":"59","author":"Contreras","year":"2011","journal-title":"Oper. Res."},{"key":"R6","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1016\/j.ejor.2005.09.024","volume":"176","author":"Campbell","year":"2007","journal-title":"Eur. J. Operat. Res."},{"key":"R7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.1120.0410","volume":"46","author":"Campbell","year":"2012","journal-title":"Trans. Sci."},{"key":"R8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.omega.2005.05.004","volume":"35","author":"Jeng\u2013Fung","year":"2007","journal-title":"Omega"},{"key":"R9","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1016\/j.ejor.2011.11.009","volume":"219","author":"Contreras","year":"2012","journal-title":"Eur. J. Operat. Res."},{"key":"R10","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.ejor.2010.04.015","volume":"207","author":"Correia","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"R11","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1016\/j.trb.2009.12.016","volume":"44","author":"Correia","year":"2010","journal-title":"Transp. Res. Part B"},{"key":"R12","doi-asserted-by":"crossref","first-page":"3671","DOI":"10.1016\/j.cor.2007.04.005","volume":"35","author":"Costa","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"R13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1018994432663","volume":"86","author":"Ernst","year":"1999","journal-title":"Ann. Oper. Res."},{"key":"R14","doi-asserted-by":"crossref","first-page":"2230","DOI":"10.1016\/j.cor.2008.08.021","volume":"36","author":"Ernst","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"R15","doi-asserted-by":"crossref","first-page":"2485","DOI":"10.1016\/j.cor.2013.01.002","volume":"40","author":"Haouari","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"R16","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.dam.2011.09.012","volume":"161","author":"Haouari","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"Hu J.Q. and Leida B., Traffic Grooming, Routing, and Wavelength Assignment in Optical WDM Mesh Networks. Proceedings of the IEEE INFOCOM 2004 (2004) 495\u2013501; Available at: DOI: https:\/\/doi.org\/10.1109\/INFCOM.2004.1354521.","DOI":"10.1109\/INFCOM.2004.1354521"},{"key":"R18","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/S0377-2217(99)00274-X","volume":"125","author":"Kara","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Larumbe F. and Sanso B., Optimal Location of Data Centers and Software Components in Cloud Computing Network Design. Proceedings of the 12th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) (2012) 841\u2013844.","DOI":"10.1109\/CCGrid.2012.124"},{"key":"R20","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/j.ejor.2006.11.026","volume":"184","author":"Rodr\u00edguez\u2013Mart\u00edn","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"R21","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1016\/j.tre.2011.04.009","volume":"47","author":"Gelareh","year":"2011","journal-title":"Trans. Res. Part E: Logistics and Trans. Rev."},{"key":"R22","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/S0377-2217(99)00325-2","volume":"127","author":"Sherali","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"R23","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"Sherali","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"R24","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"Sherali","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"R25","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.disopt.2005.10.004","volume":"3","author":"Sherali","year":"2006","journal-title":"Discrete Optimiz."},{"key":"R26","doi-asserted-by":"crossref","first-page":"3227","DOI":"10.1016\/j.cor.2004.05.009","volume":"32","author":"Yaman","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"R27","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.omega.2015.04.016","volume":"57","author":"He","year":"2015","journal-title":"Omega"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2017065\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T07:37:00Z","timestamp":1584689820000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2017065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":27,"journal-issue":{"issue":"3"},"alternative-id":["ro160203"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2017065","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,25]]}}}