{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T06:12:27Z","timestamp":1740809547904,"version":"3.38.0"},"reference-count":12,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2025,3,1]]},"DOI":"10.1587\/transinf.2024fcl0001","type":"journal-article","created":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T22:12:14Z","timestamp":1720649534000},"page":"260-262","source":"Crossref","is-referenced-by-count":0,"title":["The Least Core of Routing Game without Triangle Inequality"],"prefix":"10.1587","volume":"E108.D","author":[{"given":"Tomohiro","family":"KOBAYASHI","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering and Economics, School of Engineering, Tokyo Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomomi","family":"MATSUI","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering and Economics, School of Engineering, Tokyo Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] W.J. Cook, D.L. Applegate, R.E. Bixby, and V. Chvatal, The traveling salesman problem: a computational study, Princeton University Press, 2011.","DOI":"10.1515\/9781400841103"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] P.C. Fishburn and H.O. Pollak, \u201cFixed-route cost allocation,\u201d The American Mathematical Monthly, vol.90, no.6, pp.366-378, 1983. 10.1080\/00029890.1983.11971234","DOI":"10.1080\/00029890.1983.11971234"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] J.A.M. Potters, I.J. Curiel, and S.H. Tijs, \u201cTraveling salesman games,\u201d Mathematical Programming, vol.53, pp.199-211, 1992. 10.1007\/bf01585702","DOI":"10.1007\/BF01585702"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] J. Derks and J. Kuipers, \u201cOn the core of routing games,\u201d International Journal of Game Theory, vol.26, pp.193-205, 1997. 10.1007\/bf01295848","DOI":"10.1007\/BF01295848"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] T. Solymosi, H. Aarts, and T. Driessen, \u201cOn computing the nucleolus of a balanced connected game,\u201d Mathematics of Operations Research, vol.23, no.4, pp.983-1009, 1998. 10.1287\/moor.23.4.983","DOI":"10.1287\/moor.23.4.983"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] M. Maschler, B. Peleg, and L.S. Shapley, \u201cGeometric properties of the kernel, nucleolus, and related solution concepts,\u201d Mathematics of Operations Research, vol.4, no.4, pp.303-338, 1979. 10.1287\/moor.4.4.303","DOI":"10.1287\/moor.4.4.303"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] M. Tanaka and T. Matsui, \u201cPseudo polynomial size LP formulation for calculating the least core value of weighted voting games,\u201d Mathematical Social Sciences, vol.115, pp.47-51, 2022. 10.1016\/j.mathsocsci.2021.12.002","DOI":"10.1016\/j.mathsocsci.2021.12.002"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] R.K. Martin, \u201cUsing separation algorithms to generate mixed integer model reformulations,\u201d Operations Research Letters, vol.10, no.3, pp.119-128, 1991. 10.1016\/0167-6377(91)90028-n","DOI":"10.1016\/0167-6377(91)90028-N"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] A. Tamir, \u201cOn the core of a traveling salesman cost allocation game,\u201d Operations Research Letters, vol.8, no.1, pp.31-34, 1989. 10.1016\/0167-6377(89)90030-8","DOI":"10.1016\/0167-6377(89)90030-8"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] U. Faigle, S.P. Fekete, W. Hochst\u00e4ttler, and W. Kern, \u201cOn approximately fair cost allocation in Euclidean TSP games,\u201d Operations-Research-Spektrum, vol.20, pp.29-37, 1998. 10.1007\/bf01545526","DOI":"10.1007\/BF01545526"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] J. Kuipers, \u201cA note on the 5-person traveling salesman game,\u201d Zeitschrift f\u00fcr Operations Research, vol.38, pp.131-139, 1993. 10.1007\/bf01414209","DOI":"10.1007\/BF01414209"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Y. Okamoto, \u201cTraveling salesman games with the Monge property,\u201d Discrete Applied Mathematics, vol.138, no.3, pp.349-369, 2004. 10.1016\/j.dam.2003.08.005","DOI":"10.1016\/j.dam.2003.08.005"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/3\/E108.D_2024FCL0001\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T03:33:00Z","timestamp":1740799980000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/3\/E108.D_2024FCL0001\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,1]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2024fcl0001","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2025,3,1]]},"article-number":"2024FCL0001"}}