{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:04:32Z","timestamp":1760645072233},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1007\/bf02022997","type":"journal-article","created":{"date-parts":[[2005,8,10]],"date-time":"2005-08-10T09:49:15Z","timestamp":1123667355000},"page":"299-312","source":"Crossref","is-referenced-by-count":41,"title":["Path assignment for call routing: An application of tabu search"],"prefix":"10.1007","volume":"41","author":[{"given":"Charles A.","family":"Anderson","sequence":"first","affiliation":[]},{"given":"Kathryn","family":"Fraughnaugh","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Parker","sequence":"additional","affiliation":[]},{"given":"Jennifer","family":"Ryan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02022997_CR1","volume-title":"Handbook of Genetic Algorithms","author":"L.A. Cox","year":"1991","unstructured":"L.A. Cox, L. Davis and Y. Qiu, Dynamic anticipatory routing in circuit-switched telecommunications networks, in:Handbook of Genetic Algorithms, ed. L. Davis (Van Nostrand\/Reinhold, New York, 1991)."},{"key":"BF02022997_CR2","unstructured":"L. Davis, private communication."},{"key":"BF02022997_CR3","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover, Tabu search, Part I, ORSA J. Comput. 1(1989)190\u2013206.","journal-title":"ORSA J. Comput."},{"key":"BF02022997_CR4","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"F. Glover, Tabu search, Part II, ORSA J. Comput. 2(1990)4\u201332.","journal-title":"ORSA J. Comput."},{"key":"BF02022997_CR5","unstructured":"F. Glover and M. Laguna, Tabu search for a scheduling problem, preprint."},{"key":"BF02022997_CR6","unstructured":"Y. Qiu, private communication."},{"key":"BF02022997_CR7","unstructured":"J. Ryan (ed.), Heuristics for combinatorial optimization, CU-Denver Math Clinic Report (Spring 1990)."},{"key":"BF02022997_CR8","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"J. Yen","year":"1971","unstructured":"J. Yen, Finding thek-shortest loopless paths in a network, Manag. Sci. 17(1971)712\u2013716.","journal-title":"Manag. Sci."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02022997.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02022997\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02022997","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T18:39:56Z","timestamp":1557772796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02022997"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02022997"],"URL":"https:\/\/doi.org\/10.1007\/bf02022997","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}