{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T20:55:40Z","timestamp":1768510540809,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1007\/bf02592333","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:59:25Z","timestamp":1175183965000},"page":"83-100","source":"Crossref","is-referenced-by-count":71,"title":["On the nucleolus of the basic vehicle routing game"],"prefix":"10.1007","volume":"72","author":[{"given":"Maud","family":"G\u00f6the-Lundgren","sequence":"first","affiliation":[]},{"given":"Kurt","family":"J\u00f6rnsten","sequence":"additional","affiliation":[]},{"given":"Peter","family":"V\u00e4rbrand","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02592333_CR1","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E. Balas","year":"1989","unstructured":"E. Balas, \u201cThe prize collecting traycling salesman problem,\u201dNetworks 19 (1989) 621\u2013636.","journal-title":"Networks"},{"key":"BF02592333_CR2","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"M.L. Balinski","year":"1964","unstructured":"M.L. Balinski and R.E. Quandt, \u201cOn an integer program for a delivery problem,\u201dOperations Research 12 (1964) 300\u2013304.","journal-title":"Operations Research"},{"key":"BF02592333_CR3","first-page":"62","volume":"10","author":"L. Bodin","year":"1983","unstructured":"L. Bodin, B. Golden, A. Assad and M. Ball, \u201cRouting and scheduling of vehicles and crews: The state of the art,\u201dComputers & Operations Research 10 (1983) 62\u2013212.","journal-title":"Computers & Operations Research"},{"key":"BF02592333_CR4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N. Christofides","year":"1969","unstructured":"N. Christofides and S. Eilon, \u201cAn algorithm for the vehicle dispatching problem,\u201dOperational Research Quarterly 20 (1969) 309\u2013318.","journal-title":"Operational Research Quarterly"},{"key":"BF02592333_CR5","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"M. Desrochers, J. Desrosiers and M. Solomon, \u201cA new optimization algorithm for the vehicle routing problem with time windows,\u201dOperations Research 40 (1992) 342\u2013354.","journal-title":"Operations Research"},{"key":"BF02592333_CR6","first-page":"119","volume":"25","author":"I. Dragan","year":"1981","unstructured":"I. Dragan, \u201cA procedure for finding the nucleolus of a cooperativen person game,\u201dZeitschrift f\u00fcr Operations Research 25 (1981) 119\u2013131.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"BF02592333_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0096-3003(90)90116-K","volume":"35","author":"M. Dror","year":"1990","unstructured":"M. Dror, \u201cCost allocation: The traveling salesman, binpacking, and the knapsack,\u201dApplied Mathematics and Computation 35 (1990) 191\u2013207.","journal-title":"Applied Mathematics and Computation"},{"key":"BF02592333_CR8","series-title":"Studies in Management Science and Systems","first-page":"319","volume-title":"Vehicle Routing: Methods and Studies","author":"M. Fischetti","year":"1988","unstructured":"M. Fischetti and P. Toth, \u201cAn additive approach for the optimal solution of the prize-collecting travelling salesman problem,\u201d in: B.L. Golden and A.A. Assad. (Eds.)Vehicle Routing: Methods and Studies, Studies in Management Science and Systems vol. 16, (North-Holland, Amsterdam, 1988) pp. 319\u2013344."},{"key":"BF02592333_CR9","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.C. Gilmore","year":"1961","unstructured":"P.C. Gilmore, R.E. Gomory, \u201cA linear programming approach to the cutting stock problem,\u201dOperations Research 9 (1961) 849\u2013859.","journal-title":"Operations Research"},{"key":"BF02592333_CR10","series-title":"Studies in Management Science and Systems","volume-title":"Vehicle Routing: Methods and Studies","year":"1988","unstructured":"B.L. Golden and A.A. Assad, eds.,Vehicle Routing: Methods and Studies, Studies in Management Science and Systems, Vol. 16 (North-Holland, Amsterdam, 1988)."},{"key":"BF02592333_CR11","volume-title":"Calculation of the nucleolus when the characteristic function is given implicitly: A constraint generation approach","author":"A. Hallefjord","year":"1988","unstructured":"A. Hallefjord, R. Helmig and K. J\u00f6rnsten, \u201cCalculation of the nucleolus when the characteristic function is given implicitly: A constraint generation approach,\u201d Internal Report, Chr. Michelsen Institute, Bergen, Norway (1988)."},{"key":"BF02592333_CR12","unstructured":"A. Kopelowitz, \u201cComputation of the kernels of simple games and the nucleolus ofn person games,\u201d Research Memorandum No. 31, Department of Mathematics, The Hebrew University of Jerusalem (1967)."},{"key":"BF02592333_CR13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G. Laporte","year":"1990","unstructured":"G. Laporte and S. Martello, \u201cThe selective travelling salesman problem,\u201dDiscrete Applied Mathematics 26 (1990) 193\u2013207.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02592333_CR14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(77)90024-8","volume":"1","author":"S. Martello","year":"1977","unstructured":"S. Martello and P. Toth, \u201cAn upper bound for the zero-one knapsack problem and a branch and bound algorithm,\u201dEuropean Journal of Operational Research 1 (1977) 169\u2013175.","journal-title":"European Journal of Operational Research"},{"key":"BF02592333_CR15","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1287\/moor.4.4.303","volume":"4","author":"M. Maschler","year":"1979","unstructured":"M. Maschler, B. Peleg and L.S. Shapley, \u201cGeometric properties of the kernel, nucleolus, and related solution concepts,\u201dMathematics of Operations Research 4 (1979) 303\u2013338.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592333_CR16","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1137\/0117107","volume":"17","author":"D. Schmeidler","year":"1969","unstructured":"D. Schmeidler, \u201cThe nucleolus of a characteristic function game,\u201dSIAM Journal on Applied Mathematics 17 (1969) 1163\u20131170.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"BF02592333_CR17","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0167-6377(89)90030-8","volume":"8","author":"A. Tamir","year":"1989","unstructured":"A. Tamir, \u201cOn the core of a traveling salesman cost allocation game,\u201dOperations Research Letters 8 (1989) 31\u201334.","journal-title":"Operations Research Letters"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592333.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592333\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:55Z","timestamp":1558395475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["BF02592333"],"URL":"https:\/\/doi.org\/10.1007\/bf02592333","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}