{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:32:40Z","timestamp":1742387560233},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":[[1991,5]]},"DOI":"10.1007\/bf02073940","type":"journal-article","created":{"date-parts":[[2005,8,13]],"date-time":"2005-08-13T11:06:02Z","timestamp":1123931162000},"page":"351-362","source":"Crossref","is-referenced-by-count":41,"title":["Least-cost network topology design for a new service"],"prefix":"10.1007","volume":"33","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micheal","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer","family":"Ryan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02073940_CR1","first-page":"190","volume":"7","author":"C. Anderson","year":"1989","unstructured":"C. Anderson and C. Rasmussen, A genetic algorithm for the new service network topology problem, in:Heuristics for Combinatorial Optimization, Section 7 (1989) 190\u2013206.","journal-title":"Heuristics for Combinatorial Optimization"},{"key":"BF02073940_CR2","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 1, ORSA J. Comp. 1(1989)190\u2013206.","journal-title":"ORSA J. Comp."},{"key":"BF02073940_CR3","doi-asserted-by":"crossref","unstructured":"F. Glover, Candidate lists and tabu search, Preprint, CAAI, University of Colorado (1989).","DOI":"10.1287\/ijoc.1.3.190"},{"key":"BF02073940_CR4","first-page":"111","volume":"1","author":"A. Hertz","year":"1990","unstructured":"A. Hertz and D. de Werra, The tabu search metaheuristic: How we used it, Ann. Math. AI 1(1990)111\u2013121.","journal-title":"Ann. Math. AI"},{"key":"BF02073940_CR5","first-page":"1","volume":"6","author":"M. Lee","year":"1989","unstructured":"M. Lee, Least cost network topology design for a new service using the tabus search, in:Heuristics for Combinatorial Optimization, Section 6 (1989), pp. 1\u201318.","journal-title":"Heuristics for Combinatorial Optimization"},{"key":"BF02073940_CR6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02022093","volume":"21","author":"M. Malek","year":"1989","unstructured":"M. Malek, M. Guruswamy, H. Owens and M. Pandya, Serial and parallel search techniques for the traveling salesman problem, Ann. Oper. Res. 21(1989)59\u201384.","journal-title":"Ann. Oper. Res."},{"key":"BF02073940_CR7","unstructured":"S.H. Parrish, T. Cox, W. Keuhner and Y. Qui, Planning for least cost expansion of communications network topology, US West Advanced Technologies Science and Technology Technical Report."},{"key":"BF02073940_CR8","unstructured":"J. Ryan (ed.), Final report of mathematics clinic, in:Heuristics for Combinatorial Optimization (1989)."},{"key":"BF02073940_CR9","series-title":"Research Report","volume-title":"Tabu search applied to the quadratic assignment problem","author":"J. Skorin-Kapov","year":"1989","unstructured":"J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, Research Report HAR-89-001, W.A. Harriman School for Management and Policy, SUNY at Stony Brook, NY (1989), to appear in ORSA J. Comp."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02073940.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02073940\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02073940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T05:09:40Z","timestamp":1683176980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02073940"}},"subtitle":["An application of tabu search"],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["BF02073940"],"URL":"https:\/\/doi.org\/10.1007\/bf02073940","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}