{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T05:02:08Z","timestamp":1745211728529,"version":"3.30.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0140-3664(01)00371-1","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T14:29:16Z","timestamp":1034605756000},"page":"464-477","source":"Crossref","is-referenced-by-count":45,"title":["A tabu search approach for assigning cells to switches in cellular mobile networks"],"prefix":"10.1016","volume":"25","author":[{"given":"Samuel","family":"Pierre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"Hou\u00e9to","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(01)00371-1_BIB1","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/S0377-2217(97)00286-5","article-title":"A hybrid heuristic for the uncapacitated hub location problem","volume":"106","author":"Abdinnour-Helm","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0140-3664(01)00371-1_BIB2","doi-asserted-by":"crossref","unstructured":"Bhattacharya, P.S., Saha, D., Mukherjee, A., Heuristics for assignment of cells to switches in a PCSN: a comparative study, Proceedings 1999 IEEE Int. Conf. On Personal Wireless Comm., Feb 1999, pp. 331\u2013334.","DOI":"10.1109\/ICPWC.1999.759643"},{"key":"10.1016\/S0140-3664(01)00371-1_BIB3","unstructured":"Beaubrun, R., Pierre, S., Conan J. An efficient Method for Optimizing the Assignment of Cells to MSCs in PCS Networks, Proceedings 11th Int. Conf. on Wireless Comm., Wireless 99, vol. 1, July 1999, Calgary (AB), pp. 259\u2013265."},{"issue":"4","key":"10.1016\/S0140-3664(01)00371-1_BIB4","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1023\/A:1009673427015","article-title":"Designing least-cost survivable wireless backhaul networks","volume":"6","author":"Cox","year":"2000","journal-title":"Journal of Heuristics"},{"issue":"6","key":"10.1016\/S0140-3664(01)00371-1_BIB5","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1109\/90.650148","article-title":"Networks under general call holding time and cell residence time distributions","volume":"5","author":"Fang","year":"1997","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S0140-3664(01)00371-1_BIB6","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M., A linear-time heuristic for improving network partition, Proceedings 19th Design Automat. Conf., 1982, pp. 175-181.","DOI":"10.1109\/DAC.1982.1585498"},{"year":"1979","series-title":"Computers and Intractability","author":"Garey","key":"10.1016\/S0140-3664(01)00371-1_BIB7"},{"issue":"3","key":"10.1016\/S0140-3664(01)00371-1_BIB8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu Search \u2014 Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"issue":"4","key":"10.1016\/S0140-3664(01)00371-1_BIB9","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/inte.20.4.74","article-title":"Tabu Search: A Tutorial","volume":"20","author":"Glover","year":"1990","journal-title":"INTERFACES"},{"issue":"3","key":"10.1016\/S0140-3664(01)00371-1_BIB10","first-page":"3","article-title":"A user's guide to tabu search","volume":"41","author":"Glover","year":"1993","journal-title":"Annals of Operations Research"},{"year":"1990","series-title":"Fundamentals of computer algorithms","author":"Horowitz","key":"10.1016\/S0140-3664(01)00371-1_BIB11"},{"key":"10.1016\/S0140-3664(01)00371-1_BIB12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"The Bell System Technical Journal"},{"key":"10.1016\/S0140-3664(01)00371-1_BIB13","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"year":"1975","series-title":"Queuing Systems, I., Theory","author":"Kleinrock","key":"10.1016\/S0140-3664(01)00371-1_BIB14"},{"key":"10.1016\/S0140-3664(01)00371-1_BIB15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0377-2217(91)90090-I","article-title":"Heuristics for the p-hub location problem","volume":"53","author":"Klincewicz","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0140-3664(01)00371-1_BIB16","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1109\/TC.1987.5009543","article-title":"Constructing test cases for partitioning heuristics","volume":"C-36","author":"Krishnamurthy","year":"1987","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0140-3664(01)00371-1_BIB17","first-page":"593","article-title":"Multiway graph partitioning with applications to PCS networks","volume":"2","author":"Merchant","year":"1994","journal-title":"IEEE Infocom'94"},{"issue":"5","key":"10.1016\/S0140-3664(01)00371-1_BIB18","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1109\/90.469954","article-title":"Assignment of cells to switches in PCS networks","volume":"3","author":"Merchant","year":"1995","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S0140-3664(01)00371-1_BIB19","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","article-title":"A quadratic integer program for the location of interacting hub facilities","volume":"32","author":"O'Kelly","year":"1987","journal-title":"Journal of Operational Research"},{"issue":"3","key":"10.1016\/S0140-3664(01)00371-1_BIB20","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/24.664006","article-title":"A tabu-search approach for designing computer-network topologies with unreliable components","volume":"46","author":"Pierre","year":"1997","journal-title":"IEEE Transactions on Reliability"},{"issue":"3","key":"10.1016\/S0140-3664(01)00371-1_BIB21","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/A:1008850615965","article-title":"A simple heuristic for assignment of cells to switches in a PCS network","volume":"12","author":"Saha","year":"2000","journal-title":"Wireless Personal Communications"},{"issue":"1","key":"10.1016\/S0140-3664(01)00371-1_BIB22","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","article-title":"Tabu search applied to the quadratic assignment problem","volume":"2","author":"Skorin-Kapov","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0140-3664(01)00371-1_BIB23","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1016\/0377-2217(94)90245-3","article-title":"On tabu search for the location of interacting hub facilities","volume":"73","author":"Skorin-Kapov","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0140-3664(01)00371-1_BIB24","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0377-2217(97)00201-4","article-title":"Efficient solution procedure and reduced size formulations for p-hub location problems","volume":"108","author":"Sohn","year":"1998","journal-title":"European Journal of Operational Research"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366401003711?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366401003711?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T02:45:56Z","timestamp":1733280356000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366401003711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0140366401003711"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(01)00371-1","relation":{},"ISSN":["0140-3664"],"issn-type":[{"type":"print","value":"0140-3664"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}