{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T06:12:06Z","timestamp":1672726326055},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. T\u00e9l\u00e9commun."],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1007\/bf03002701","type":"journal-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T08:34:26Z","timestamp":1625646866000},"source":"Crossref","is-referenced-by-count":1,"title":["Affectation heuristique de cellules \u00e0 des commutateurs dans les r\u00e9seaux cellulaires pour mobiles"],"prefix":"10.1007","volume":"56","author":[{"given":"F.","family":"Hou\u00e9to","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"pierre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03002701_CR1","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0377-2217(97)00286-5","volume":"106","author":"(S.) Abdinnour-Helm","year":"1998","unstructured":"Abdinnour-Helm (S.), A hybrid heuristic for the uncapacitated hub location problem,European Journal of Operational Research (1998),106, pp. 489\u2013499.","journal-title":"European Journal of Operational Research"},{"key":"BF03002701_CR2","first-page":"259","volume":"1","author":"(R.) Beaubrun","year":"1999","unstructured":"Beaubrun (R.), Pierre (S.), Conan (J.), An efficient Method for Optimizing the Assignment of Cells to mscs in pcs Networks.Proceedings of 11th International Conference on Wireless Communication, Wireless 99, Calgary (July 1999),1, pp. 259\u2013265.","journal-title":"Proceedings of 11th International Conference on Wireless Communication, Wireless 99"},{"key":"BF03002701_CR3","doi-asserted-by":"crossref","unstructured":"Fiduccia (C. M.) et.Mattheyses (R. M.), A Linear-time Heuristic for Improving Network partition,Proceedings of 19th Design Automation Conference (1982), pp. 175\u2013181.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"BF03002701_CR4","volume-title":"Computers and intractability","author":"(M. R.) Garey","year":"1979","unstructured":"Garey (M. R.), Johnson (D. S.),Computers and intractability, San Francisco, Freeman, (1979)."},{"key":"BF03002701_CR5","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"(M.) Gendreau","year":"1994","unstructured":"Gendreau (M.), Hertz (A.), Laporte (G.), A tabu search heuristic for the vehicle routing problems,Management Science (1994), n\u00b0 40, pp. 1276\u20131290.","journal-title":"Management Science"},{"issue":"3","key":"BF03002701_CR6","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"l","author":"(F.) Glover","year":"1989","unstructured":"Glover (F.), Tabu Search \u2014 Part I.orsa Journal on Computing (1989), l, n\u00b03, pp. 190\u2013206.","journal-title":"orsa Journal on Computing"},{"issue":"4","key":"BF03002701_CR7","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"(F.) Glover","year":"1990","unstructured":"Glover (F.), Tabu Search: A Tutorial,interfaces (1990), 20, n\u00b0 4, pp. 74\u201394.","journal-title":"interfaces"},{"key":"BF03002701_CR8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"(E.) Glover","year":"1990","unstructured":"Glover (E.), Tabu Search \u2014 Part II.orsa Journal on Computing (1990), 2, pp. 4\u201332.","journal-title":"orsa Journal on Computing"},{"issue":"3","key":"BF03002701_CR9","first-page":"3","volume":"41","author":"(E.) Glover","year":"1993","unstructured":"Glover (E.), Taillard (E.), de Werra (D.), A user\u2019s guide to tabu search,Annals of Operations Research (1993), 41, n\u00b0 3, pp. 3\u201328.","journal-title":"Annals of Operations Research"},{"key":"BF03002701_CR10","first-page":"1835","volume":"3","author":"(P.R.L.) Gondim","year":"1996","unstructured":"Gondim (P.R.L.), Genetic Algorithms and the Location Area Partitioning Problem in Cellular Networks,IEEE Vehicular Technology Conference (1996), 3, pp 1835\u20131838.","journal-title":"IEEE Vehicular Technology Conference"},{"key":"BF03002701_CR11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"(B.W.) Kernighan","year":"1970","unstructured":"Kernighan (B.W.), Lin (S.), An Efficient Heuristic Procedure for Partitioning Graphs,The Bell System Technical Journal (1970),49, pp. 291\u2013307.","journal-title":"The Bell System Technical Journal"},{"key":"BF03002701_CR12","volume-title":"Queuing Systems I : Theory","author":"(L.) Kleinrock","year":"1975","unstructured":"Kleinrock (L.),Queuing Systems I: Theory, New York, Wiley (1975)."},{"key":"BF03002701_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0377-2217(91)90090-I","volume":"53","author":"(J.G.) Klincewicz","year":"1991","unstructured":"Klincewicz (J.G.), Heuristics for the p-hub location problem.European Journal of Operational Research (1991), 53, pp. 25\u201337.","journal-title":"European Journal of Operational Research"},{"key":"BF03002701_CR14","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TC.1987.5009543","volume":"C-36","author":"(B.) Krishnamurthy","year":"1987","unstructured":"Krishnamurthy (B.), Constructing Test Cases for Partitioning Heuristics,IEEE Transactions on Computers (1987),C-36, pp. 1112\u20131114.","journal-title":"IEEE Transactions on Computers"},{"key":"BF03002701_CR15","first-page":"593","volume":"2","author":"(A.) Merchant","year":"1994","unstructured":"Merchant (A.), Sengupta (B.), Multiway graph partitioning with applications to pcs networks,IEEE Infocom\u201994 (1994),2, pp. 593\u2013600.","journal-title":"IEEE Infocom\u201994"},{"issue":"5","key":"BF03002701_CR16","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1109\/90.469954","volume":"3","author":"(A.) Merchant","year":"1995","unstructured":"Merchant (A.), Sengupta (B.), Assignment of Cells to Switches in PCS Networks,ieee\/acm Transactions on Networking (1995),3, n\u00b0 5, pp. 521\u2013526.","journal-title":"ieee\/acm Transactions on Networking"},{"key":"BF03002701_CR17","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","volume":"32","author":"(M. E.) O\u2019Kelly","year":"1987","unstructured":"O\u2019Kelly (M. E.), A quadratic integer program for the location of interacting hub facilities,European Journal of Operational Research (1987),32, pp. 393\u2013404.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"BF03002701_CR18","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1109\/24.664006","volume":"46","author":"(S.) Pierre","year":"1997","unstructured":"Pierre (S.), Elgibaoui (A.), A Tabu-Search Approach for Designing Computer-Network Topologies with Unreliable Components,IEEE Transactions on Reliability (1997),46, n\u00b0 3, pp. 350\u2013359.","journal-title":"IEEE Transactions on Reliability"},{"issue":"2","key":"BF03002701_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1109\/3477.662766","volume":"28","author":"(S.) Pierre","year":"1998","unstructured":"Pierre (S.), Legault (G.), A Genetic Algorithm for Designing Distributed Computer Network Topologies,ieee Transactions on Systems, Man, and Cybernetics \u2014 Part B: Cybernetics (April 1998),28, n\u00b0 2, pp. 249\u2013258.","journal-title":"ieee Transactions on Systems, Man, and Cybernetics \u2014 Part B : Cybernetics"},{"key":"BF03002701_CR20","first-page":"871","volume":"2","author":"(J.) Plehn","year":"1995","unstructured":"Plehn (J.), The design of location areas in a GSM-network,ieee VehicularTechnology Conference (1995), 2, pp 871\u2013875.","journal-title":"ieee VehicularTechnology Conference"},{"issue":"1","key":"BF03002701_CR21","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","volume":"2","author":"Kapov (J.) Skorin \u2014","year":"1989","unstructured":"Skorin \u2014 Kapov (J.), Tabu search applied to the quadratic assignment problem,orsa Journal on Computing (1989),2, n\u00b0 1, pp. 33\u201345.","journal-title":"orsa Journal on Computing"},{"key":"BF03002701_CR22","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0377-2217(94)90245-3","volume":"73","author":"(D.) Skorin-Kapov","year":"1994","unstructured":"Skorin-Kapov (D.), Skorin-Kapov (J.), On tabu search for the location of interacting hub facilities,European Journal of Operational Research (1994),73, pp. 502\u2013509.","journal-title":"European Journal of Operational Research"},{"key":"BF03002701_CR23","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/S0377-2217(97)00201-4","volume":"108","author":"(J.) Sohn","year":"1998","unstructured":"Sohn (J.), Park (S.), Efficient solution procedure and reduced size formulations for p-hub location problems,European Journal of Operational Research (1998),108, pp. 118\u2013126.","journal-title":"European Journal of Operational Research"}],"container-title":["Annales Des T\u00e9l\u00e9communications"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03002701.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF03002701\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03002701.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T09:49:45Z","timestamp":1625651385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF03002701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":23,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["BF03002701"],"URL":"https:\/\/doi.org\/10.1007\/bf03002701","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,3]]},"article-number":"184"}}