{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:40:10Z","timestamp":1747654810249,"version":"3.40.5"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[1999,12]]},"DOI":"10.1023\/a:1009628321600","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"385-402","source":"Crossref","is-referenced-by-count":1,"title":["Applying GIS and Combinatorial Optimization to Fiber Deployment Plans"],"prefix":"10.1007","volume":"5","author":[{"given":"Buyang","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghe","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Macleod","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"241783_CR1","volume-title":"Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing","author":"E.H.L Aarts","year":"1989","unstructured":"Aarts, E.H.L and J.H. Korst. (1989). Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. New York: Wiley."},{"issue":"8","key":"241783_CR2","first-page":"693","volume":"29","author":"J. Braca","year":"1997","unstructured":"Braca, J., J. Bramel, B. Posner, and D. Simchi-Levi. (1997). \u201cA Computerized Approach to the New York City School Bus Routing Problem,\u201d IIE Transactions 29(8), 693\u2013702.","journal-title":"IIE Transactions"},{"key":"241783_CR3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0377-2217(84)90093-6","volume":"15","author":"R.E. Burkard","year":"1984","unstructured":"Burkard, R.E. (1984). \u201cQuadratic Assignment Problems,\u201d European Journal of Operational Research 15, 283\u2013289.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"241783_CR4","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1287\/mnsc.43.7.908","volume":"43","author":"B. Cao","year":"1997","unstructured":"Cao, B. and F. Glover. (1997). \u201cTabu Search and Ejection Chains\u2014Application to a Node Weighted Version of the Cardinality-Constrained TSP,\u201d Management Science 43(7), 908\u2013921.","journal-title":"Management Science"},{"key":"241783_CR5","series-title":"Technique Report","volume-title":"Search-Hide Games on Graphs","author":"B. Cao","year":"1993","unstructured":"Cao, B. and B. von Stengel. (1993). \u201cSearch-Hide Games on Graphs.\u201d Technique Report S-9303, University of the Federal Armed Forces Munich, Neubiberg, Germany."},{"key":"241783_CR6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W. (1959). \u201cA Note on Two Problems in Connection with Graphs,\u201d Numerische Mathematik 1, 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"241783_CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/ijoc.6.2.141","volume":"6","author":"U. Dorndorf","year":"1994","unstructured":"Dorndorf, U. and E. Pesch. (1994). \u201cFast Clustering Algorithms,\u201d ORSA Journal on Computing 6, 141\u2013153.","journal-title":"ORSA Journal on Computing"},{"key":"241783_CR8","unstructured":"Erkut, E. (1996). \u201cThe Road Not Taken,\u201d OR\/MS Today December 1996, 22\u201328."},{"key":"241783_CR9","unstructured":"ESRI, Inc. (1994). Proceedings of the 1994 User Conference. California: Redlands."},{"key":"241783_CR10","first-page":"61","volume":"31","author":"G. Finke","year":"1987","unstructured":"Finke, G., Burkard, R.E., and F. Rendl. (1987). \u201cQuadratic Assignment Problems,\u201d Annals of Discrete Mathematics 31, 61\u201382.","journal-title":"Annals of Discrete Mathematics"},{"key":"241783_CR11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/net.3230240103","volume":"24","author":"M. Fischetti","year":"1994","unstructured":"Fischetti, M., Hamacher, H.W., Jrnsten, K., and F. Maffioli. (1994). \u201cWeighted k-Cardinality Trees: Complexity and Polyhedral Structure,\u201d Networks 24, 11\u201321.","journal-title":"Networks"},{"key":"241783_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: W.H. Freeman."},{"key":"241783_CR13","doi-asserted-by":"crossref","unstructured":"Glover, F. (1992). Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems. School of Business, University of Colorado at Boulder.","DOI":"10.1016\/B978-0-08-040806-4.50037-X"},{"key":"241783_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F. and M. Laguna. (1997). Tabu Search. Hingham, MA: Kluwar Academic Publishers."},{"key":"241783_CR15","volume-title":"Adaptation in Natural and Artificial Systems.","author":"J. Holland","year":"1975","unstructured":"Holland, J. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor, MI: University of Michigan Press."},{"key":"241783_CR16","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1007\/BF01009452","volume":"34","author":"S. Kirkpatrick","year":"1984","unstructured":"Kirkpatrick, S. (1984). \u201cOptimization by Simulated Annealing: Quantitative Studies,\u201d Journal of Statistical Physics 34, 975\u2013986.","journal-title":"Journal of Statistical Physics"},{"key":"241783_CR17","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"222","author":"S. Kirkpatric","year":"1983","unstructured":"Kirkpatric, S., Gelatt, C.D., and M.P. Vecchi. (1983). \u201cOptimization by Simulated Annealing,\u201d Science 222, 671\u2013680.","journal-title":"Science"},{"volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","year":"1985","key":"241783_CR18","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and D.B. Shmoys. (eds.). (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. New York: Wiley."},{"key":"241783_CR19","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S. (1965). \u201cComputer Solutions of the Traveling Salesman Problem,\u201d Bell System Technical Journal 44, 2245\u20132269.","journal-title":"Bell System Technical Journal"},{"key":"241783_CR20","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L. and L.A. Wolsey. (1988). Integer and Combinatorial Optimization. New York: Wiley."},{"key":"241783_CR21","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0166-218X(96)00123-0","volume":"76","author":"E. Pesch","year":"1997","unstructured":"Pesch, E. and F. Glover. (1997). \u201cTSP Ejection Chains,\u201d Discrete Applied Mathematics 76, 165\u2013181.","journal-title":"Discrete Applied Mathematics"},{"key":"241783_CR22","volume-title":"The Travelling Salesman Problem: Computational Solutions for TSP Applications","author":"G. Reinelt","year":"1994","unstructured":"Reinelt, G. (1994). The Travelling Salesman Problem: Computational Solutions for TSP Applications. Berlin, Germany: Springer-Verlag."},{"key":"241783_CR23","volume-title":"Geographic Information Systems\u2014An Introduction","author":"J. Star","year":"1990","unstructured":"Star, J. and J. Estes. (1990). Geographic Information Systems\u2014An Introduction. Englewood Cliffs, NJ: Prentice Hall."},{"key":"241783_CR24","first-page":"945","volume":"2","author":"M. Sun","year":"1997","unstructured":"Sun, M. (1997). \u201cApplying Tabu Search to Multiple Objective Combinatorial Optimization Problems,\u201d Proceedings of the 1997 DSI Annual Meeting. Vol. 2, pp. 945\u2013947.","journal-title":"Proceedings of the 1997 DSI Annual Meeting"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009628321600.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009628321600\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009628321600.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:06:01Z","timestamp":1747652761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009628321600"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["241783"],"URL":"https:\/\/doi.org\/10.1023\/a:1009628321600","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}