{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T01:28:27Z","timestamp":1780363707738,"version":"3.54.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T00:00:00Z","timestamp":1588550400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T00:00:00Z","timestamp":1588550400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10479-020-03616-6","type":"journal-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T20:02:36Z","timestamp":1588622556000},"page":"341-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Approximation of the Shapley value for the Euclidean travelling salesman game"],"prefix":"10.1007","volume":"289","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6749-0567","authenticated-orcid":false,"given":"Dan C.","family":"Popescu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7349-1179","authenticated-orcid":false,"given":"Philip","family":"Kilby","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,5,4]]},"reference":[{"issue":"1","key":"3616_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-015-1981-7","volume":"235","author":"M Albizuri","year":"2015","unstructured":"Albizuri, M., Echarri, J., & Zarzuelo, J. (2015). A non-cooperative mechanism for the Shapley value of airport problems. Annals of Operations Research, 235(1), 1\u201311.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"3616_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-014-1754-8","volume":"225","author":"NG Andjiga","year":"2015","unstructured":"Andjiga, N. G., & Courtin, S. (2015). Coalition configurations and share functions. Annals of Operations Research, 225(1), 3\u201325.","journal-title":"Annals of Operations Research"},{"key":"3616_CR3","volume-title":"The travelling salesman problem: A computational study","author":"DL Applegate","year":"2007","unstructured":"Applegate, D. L., Bixby, R. E., Chvatal, V., & Cook, W. J. (2007). The travelling salesman problem: A computational study. Princeton: Princeton University Press."},{"key":"3616_CR4","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1613\/jair.5021","volume":"56","author":"H Aziz","year":"2016","unstructured":"Aziz, H., Cahan, C., Gretton, C., Kilby, P., Mattei, N., & Walsh, T. (2016). A study of proxies for Shapley allocations of transport costs. Journal of Artificial Intelligence Research, 56, 573\u2013611.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"3616_CR5","first-page":"3","volume":"158","author":"JM Bilbao","year":"2008","unstructured":"Bilbao, J. M., Fernandez, J. R., Jimenez, N., & Lopez, J. J. (2008). The Shapley value for bicooperative games. Annals of Operations Research, 158(1), 3\u201325.","journal-title":"Annals of Operations Research"},{"issue":"1\u20132","key":"3616_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-017-2651-8","volume":"259","author":"F Briata","year":"2017","unstructured":"Briata, F., Dall\u2019Aglio, A., Dall\u2019Aglio, M., & Frangelli, V. (2017). The Shapley value in the Knaster game. Annals of Operations Research, 259(1\u20132), 1\u201319.","journal-title":"Annals of Operations Research"},{"key":"3616_CR7","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1016\/j.cor.2008.04.004","volume":"36","author":"J Castro","year":"2009","unstructured":"Castro, J., Gomez, D., & Tejada, J. (2009). Polynomial calculation of the Shapley value based on sampling. Computers & Operations Research, 36, 1726\u20131730.","journal-title":"Computers & Operations Research"},{"key":"3616_CR8","unstructured":"Christofides, N. (1976). Worst-case analysis of a new heuristic for the travelling salesman problem. DTIC Document: Technical report."},{"key":"3616_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-3028-3","author":"F Ciardello","year":"2018","unstructured":"Ciardello, F., Genovese, A., & Simpson, A. (2018). A unified cooperative model for environmental costs in supply chains: The Shapley value for the linear case. Annals of Operations Research,. https:\/\/doi.org\/10.1007\/s10479-018-3028-3.","journal-title":"Annals of Operations Research"},{"key":"3616_CR10","unstructured":"Derks, J. J. M., & Haller, H. H. (1995). Null player out: Values for games with variable supports, Raport M, 95\u201314. Department of Mathematics, Limburg University, Maastricht, The Netherlands."},{"key":"3616_CR11","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1016\/j.ejor.2012.02.017","volume":"220","author":"B Dong","year":"2012","unstructured":"Dong, B., Guo, G., & Wang, Y. (2012). Highway toll pricing. European Journal of Operational Research, 220, 744\u2013751.","journal-title":"European Journal of Operational Research"},{"key":"3616_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF01545526","volume":"20","author":"U Faigle","year":"1998","unstructured":"Faigle, U., Fekete, S., Hochst\u00e4ttller, W., & Kern, W. (1998). On approximately fair cost allocation in Euclidean TSP games. Operations Research Spektrum, 20, 29\u201337.","journal-title":"Operations Research Spektrum"},{"key":"3616_CR13","volume-title":"The vehicle routing problem: Latest advances and challenges","year":"2008","unstructured":"Golden, B., Raghaven, S., & Wasil, E. (Eds.). (2008). The vehicle routing problem: Latest advances and challenges. Berlin: Springer."},{"key":"3616_CR14","volume-title":"Combinatorial identities","author":"HW Gould","year":"1972","unstructured":"Gould, H. W. (1972). Combinatorial identities. Morgantown: Morgantown Printing and Binding Co."},{"key":"3616_CR15","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1111\/itor.12205","volume":"23","author":"M Guajardo","year":"2016","unstructured":"Guajardo, M., & R\u00f6nnquist, M. (2016). A review on cost allocation methods in collaborative transportation. International Transactions in Operational Research, 23, 371\u2013392.","journal-title":"International Transactions in Operational Research"},{"key":"3616_CR16","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.ejor.2013.01.018","volume":"228","author":"J Kuipers","year":"2013","unstructured":"Kuipers, J., Mosquera, M. A., & Zarzuelo, J. M. (2013). Sharing costs in highways: A game theoretic approach. European Journal of Operational Research, 228, 158\u2013168.","journal-title":"European Journal of Operational Research"},{"key":"3616_CR17","first-page":"1985","volume-title":"The Traveling salesman problem: A guided tour of combinatorial optimization","author":"EL Lawler","year":"1985","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, B. D. (1985). The Traveling salesman problem: A guided tour of combinatorial optimization (p. 1985). New York: Wiley."},{"key":"3616_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-3047-0","author":"PH Le","year":"2018","unstructured":"Le, P. H., Nguyen, T. D., & Bektas, T. (2018). Efficient computation of the Shapley value for large-scale linear production games. Annals of Operations Research,. https:\/\/doi.org\/10.1007\/s10479-018-3047-0.","journal-title":"Annals of Operations Research"},{"key":"3616_CR19","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1287\/mnsc.20.3.370","volume":"20","author":"SC Littlechild","year":"1973","unstructured":"Littlechild, S. C., & Owen, G. (1973). A simple expression for the Shapley value in a special case. Management Science, 20, 370\u2013372.","journal-title":"Management Science"},{"key":"3616_CR20","unstructured":"Mann I. & Shapley L. S. (1960). Values for large games, IV: Evaluating the electoral college by Monte Carlo techniques, Technical report, RAND Corporation."},{"issue":"1\u20132","key":"3616_CR21","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10479-018-2803-5","volume":"274","author":"H Omrani","year":"2019","unstructured":"Omrani, H., Shafaat, K., & Alizadeh, A. (2019). Integrated data envelopment analysis and cooperative game for evaluating energy efficiency of transportation sector: A case of Iran. Annals of Operations Research, 274(1\u20132), 471\u2013499.","journal-title":"Annals of Operations Research"},{"key":"3616_CR22","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1287\/opre.1120.1130","volume":"51","author":"OO \u00d6zener","year":"2013","unstructured":"\u00d6zener, O. O., Ergun, O., & Savelsbergh, M. (2013). Allocation cost of service to customers in inventory routing. Operations Research, 51, 112\u2013125.","journal-title":"Operations Research"},{"issue":"1","key":"3616_CR23","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10479-007-0242-9","volume":"158","author":"J Puerto","year":"2008","unstructured":"Puerto, J., Fernandez, F. R., & Hinojosa, Y. (2008). Partially ordered cooperative games: extended core and Shapley value. Annals of Operations Research, 158(1), 143\u2013159.","journal-title":"Annals of Operations Research"},{"key":"3616_CR24","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.trb.2016.11.014","volume":"97","author":"EC Rosenthal","year":"2017","unstructured":"Rosenthal, E. C. (2017). A cooperative game approach to cost allocation in a rapid-transit network. Transportation Research Part B, 97, 64\u201377.","journal-title":"Transportation Research Part B"},{"key":"3616_CR25","first-page":"31","volume-title":"The Shapley value","author":"LS Shapley","year":"1953","unstructured":"Shapley, L. S. (1953). A value for n-person games. In A. E. Roth (Ed.), The Shapley value (pp. 31\u201340). Cambridge: Cambridge University Press."},{"key":"3616_CR26","doi-asserted-by":"crossref","unstructured":"Toth, P., & Vigo, D. (Eds.). (2014). Vehicle routing: Problems, methods, and applications, 2nd edn (Vol 18). MOS-SIAM series on optimization. Philadelphia: SIAM.","DOI":"10.1137\/1.9781611973594"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03616-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-020-03616-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03616-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T00:15:36Z","timestamp":1620087336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-020-03616-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,4]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["3616"],"URL":"https:\/\/doi.org\/10.1007\/s10479-020-03616-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,4]]},"assertion":[{"value":"4 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}