{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:47Z","timestamp":1750307687627,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,11,5]],"date-time":"2008-11-05T00:00:00Z","timestamp":1225843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,11,5]]},"DOI":"10.1145\/1463434.1463449","type":"proceedings-article","created":{"date-parts":[[2008,12,4]],"date-time":"2008-12-04T00:11:33Z","timestamp":1228349493000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Heuristic algorithms for route-search queries over geographical data"],"prefix":"10.1145","author":[{"given":"Yaron","family":"Kanza","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Eliyahu","family":"Safra","sequence":"additional","affiliation":[{"name":"ESRI, Redlands, CA"}]},{"given":"Yehoshua","family":"Sagiv","sequence":"additional","affiliation":[{"name":"Hebrew University, Jerusalem, Israel"}]},{"given":"Yerach","family":"Doytsher","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2008,11,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/357456.357458"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00035-6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00289-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0895-7177(96)00187-2"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591729"},{"key":"e_1_3_2_1_6_1","first-page":"231","article-title":"A branch and bound algorithm for solving the multiple choice knapsack problem","volume":"11","author":"Dyer M.","year":"1984","unstructured":"M. Dyer , N. Kayal , and J. Walker . A branch and bound algorithm for solving the multiple choice knapsack problem . IJCAM , 11 : 231 -- 249 , 1984 . M. Dyer, N. Kayal, and J. Walker. A branch and bound algorithm for solving the multiple choice knapsack problem. IJCAM, 11:231--249, 1984.","journal-title":"IJCAM"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.3.378"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(198806)35:3<359::AID-NAV3220350305>3.0.CO;2-H"},{"key":"e_1_3_2_1_10_1","first-page":"43","article-title":"The record balancing problem - a dynamic programming solution of a generalized traveling salesman problem","volume":"2","author":"Henry-Labordere A.","year":"1969","unstructured":"A. Henry-Labordere . The record balancing problem - a dynamic programming solution of a generalized traveling salesman problem . Revue Francaise D Informatique DeRecherche Operationnelle , 2 : 43 -- 49 , 1969 . A. Henry-Labordere. The record balancing problem - a dynamic programming solution of a generalized traveling salesman problem. Revue Francaise D Informatique DeRecherche Operationnelle, 2:43--49, 1969.","journal-title":"Revue Francaise D Informatique DeRecherche Operationnelle"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4573(00)00015-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90388-3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1996.190"},{"key":"e_1_3_2_1_14_1","volume-title":"Congressus Numerantium, 48: 277--290","author":"Laporte G.","year":"1985","unstructured":"G. Laporte , H. Mercure , and Y. Nobert . Finding the shortest hamiltonian circuit through n clusters: A lagrangian approach . Congressus Numerantium, 48: 277--290 , 1985 . G. Laporte, H. Mercure, and Y. Nobert. Finding the shortest hamiltonian circuit through n clusters: A lagrangian approach. Congressus Numerantium, 48:277--290, 1985."},{"issue":"1","key":"e_1_3_2_1_15_1","first-page":"61","article-title":"Generalized traveling salesman problem through n-sets of nodes - an integer programming approach","volume":"21","author":"Laporte G.","year":"1983","unstructured":"G. Laporte and Y. Nobert . Generalized traveling salesman problem through n-sets of nodes - an integer programming approach . INFOR , 21 ( 1 ): 61 -- 75 , 1983 . G. Laporte and Y. Nobert. Generalized traveling salesman problem through n-sets of nodes - an integer programming approach. INFOR, 21(1):61--75, 1983.","journal-title":"INFOR"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)90247-X"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(93)90133-7"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.4.623"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00015-I"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.4.2.155"},{"key":"e_1_3_2_1_21_1","first-page":"109","volume-title":"Proc. of the Text REtrieval Conference (TREC-3)","author":"Robertson S.","year":"1994","unstructured":"S. Robertson , S. Walker , S. Jones , M. Hancock-Beaulieu , and M. Gatford . Okapi at trec-3 . In Proc. of the Text REtrieval Conference (TREC-3) , pages 109 -- 126 , Gaithersburg, USA , 1994 . S. Robertson, S. Walker, S. Jones, M. Hancock-Beaulieu, and M. Gatford. Okapi at trec-3. In Proc. of the Text REtrieval Conference (TREC-3), pages 109--126, Gaithersburg, USA, 1994."},{"key":"e_1_3_2_1_22_1","volume-title":"Introduction to modern information retrieval","author":"Salton G.","year":"1983","unstructured":"G. Salton and M. McGill . Introduction to modern information retrieval . McGraw-Hill , 1983 . G. Salton and M. McGill. Introduction to modern information retrieval. McGraw-Hill, 1983."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376623"},{"key":"e_1_3_2_1_24_1","first-page":"185","article-title":"Mathematical model for scheduling clients through welfare agencies","volume":"8","author":"Saskena J. P.","year":"1970","unstructured":"J. P. Saskena . Mathematical model for scheduling clients through welfare agencies . J. of the Canadian Operational Research Society , 8 : 185 -- 200 , 1970 . J. P. Saskena. Mathematical model for scheduling clients through welfare agencies. J. of the Canadian Operational Research Society, 8:185--200, 1970.","journal-title":"J. of the Canadian Operational Research Society"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025153016110"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.27.3.503"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.09.057"},{"key":"e_1_3_2_1_28_1","first-page":"97","article-title":"Generalized traveling salesman problem through n sets of nodes","volume":"7","author":"Srivastava S. S.","year":"1969","unstructured":"S. S. Srivastava , S. Kumar , R. C. Garg , and P. Sen . Generalized traveling salesman problem through n sets of nodes . Journal of the Canadian Operational Research Society , 7 : 97 -- 101 , 1969 . S. S. Srivastava, S. Kumar, R. C. Garg, and P. Sen. Generalized traveling salesman problem through n sets of nodes. Journal of the Canadian Operational Research Society, 7:97--101, 1969.","journal-title":"Journal of the Canadian Operational Research Society"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1984.162"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90014-0"}],"event":{"name":"GIS '08: 16th International Symposium on Advances in Geographic Information Systems","sponsor":["ESRI","Google Inc.","Oak Ridge National Laboratory","Microsoft Microsoft","SIGSPATIAL ACM Special Interest Group on Spatial Information"],"location":"Irvine California","acronym":"GIS '08"},"container-title":["Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1463434.1463449","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1463434.1463449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:50Z","timestamp":1750253390000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1463434.1463449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,5]]},"references-count":30,"alternative-id":["10.1145\/1463434.1463449","10.1145\/1463434"],"URL":"https:\/\/doi.org\/10.1145\/1463434.1463449","relation":{},"subject":[],"published":{"date-parts":[[2008,11,5]]},"assertion":[{"value":"2008-11-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}