{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:25:16Z","timestamp":1773617116431,"version":"3.50.1"},"reference-count":20,"publisher":"Pleiades Publishing Ltd","issue":"7","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Autom Remote Control"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1134\/s0005117919070129","type":"journal-article","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T03:03:22Z","timestamp":1562900602000},"page":"1358-1367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Coalition-Formation Problem for Cooperative Inventory Routing Game"],"prefix":"10.1134","volume":"80","author":[{"given":"V. A.","family":"Shirokikh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. A.","family":"Lezhnina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"issue":"3","key":"1005_CR1","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1287\/trsc.1060.0188","volume":"41","author":"C Archetti","year":"2007","unstructured":"Archetti, C., Bertazzi, L., Laporte, G., and Speranza, M.G., A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem, Transport. Sci., 2007, vol. 41, no. 3, pp. 382\u2013391.","journal-title":"Transport. Sci."},{"issue":"3","key":"1005_CR2","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1111\/itor.12076","volume":"21","author":"C Archetti","year":"2014","unstructured":"Archetti, C., Bianchessi, N., Irnich, S., and Speranza, M.G., Formulations for an Inventory Routing Problem, Int. Transact. Operat. Res., 2014, vol. 21, no. 3, pp. 353\u2013374.","journal-title":"Int. Transact. Operat. Res."},{"issue":"4","key":"1005_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01766876","volume":"3","author":"RJ Aumann","year":"1974","unstructured":"Aumann, R.J. and Dreze J.H., Cooperative Games with Coalition Structures, Int. J. Game Theory, 1974, vol. 3, no. 4, pp. 217\u2013237","journal-title":"Int. J. Game Theory"},{"key":"1005_CR4","volume-title":"Dynamic Programming","author":"R Bellman","year":"1957","unstructured":"Bellman, R., Dynamic Programming, Princeton: Princeton Univ. Press, 1957."},{"issue":"1","key":"1005_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.2013.0472","volume":"48","author":"LC Coelho","year":"2013","unstructured":"Coelho, L.C., Cordeau, J.F., and Laporte, G., Thirty Years of Inventory Routing, Transport. Sci., 2013, vol. 48, no. 1, pp. 1\u201319.","journal-title":"Transport. Sci."},{"issue":"11","key":"1005_CR6","doi-asserted-by":"publisher","first-page":"2537","DOI":"10.1016\/j.cor.2011.12.020","volume":"39","author":"LC Coelho","year":"2012","unstructured":"Coelho, L.C., Cordeau, J.F., and Laporte, G., The Inventory-Routing Problem with Transshipment, Comput. Operat. Res., 2012, vol. 39, no. 11, pp. 2537\u20132548.","journal-title":"Comput. Operat. Res."},{"key":"1005_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.cor.2014.06.007","volume":"55","author":"JF Cordeau","year":"2015","unstructured":"Cordeau, J.F., Lagana, D., Musmanno, R., and Vocaturo, F., A Decomposition-Based Heuristic for the Multiple-Product Inventory-Routing Problem, Comput. Operat. Res., 2015, vol. 55, pp. 153\u2013166.","journal-title":"Comput. Operat. Res."},{"issue":"3","key":"1005_CR8","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1287\/trsc.2015.0635","volume":"50","author":"G Desaulniers","year":"2015","unstructured":"Desaulniers, G., Rakke, J.G., and Coelho, L.C., A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem, Transport. Sci., 2015, vol. 50, no. 3, pp. 1060\u20131076.","journal-title":"Transport. Sci."},{"issue":"10","key":"1005_CR9","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1029\/WR021i010p01469","volume":"21","author":"TSH Driessen","year":"1985","unstructured":"Driessen, T.S.H. and Tijs, S.H., The Cost Gap Method and Other Cost Allocation Methods for Multipurpose Water Projects, Water Resources Res., 1985, vol. 21, no. 10, pp. 1469\u20131475.","journal-title":"Water Resources Res."},{"key":"1005_CR10","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.ejor.2010.01.015","volume":"205","author":"M Frisk","year":"2010","unstructured":"Frisk, M., Gothe-Lundgren, M., Jornsten, K., and Ronnqvist, M., Cost Allocation in Collaborative Forest Transportation, Eur. J. Operat. Res., 2010, vol. 205, pp. 448\u2013458.","journal-title":"Eur. J. Operat. Res."},{"issue":"3","key":"1005_CR11","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1111\/itor.12205","volume":"23","author":"M Guajardo","year":"2016","unstructured":"Guajardo, M. and Ronnqvist, M., A Review on Cost Allocation Methods in Collabora-Tive Transportation, Int. Transact. Operat. Res., 2016, vol. 23, no. 3, pp. 371\u2013392.","journal-title":"Int. Transact. Operat. Res."},{"issue":"2","key":"1005_CR12","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.ejor.2016.07.040","volume":"257","author":"JB Jouida","year":"2017","unstructured":"Jouida, J.B., Sihem, K., Krichen, S., and Klibi, W., Coalition-Formation Problem for Sourcing Contract Design in Supply Networks, Eur. J. Operat. Res., 2017, vol. 257, no. 2, pp. 539\u2013558.","journal-title":"Eur. J. Operat. Res."},{"issue":"3","key":"1005_CR13","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1016\/j.ejor.2015.08.002","volume":"248","author":"A Kimms","year":"2016","unstructured":"Kimms, A. and Kozeletskyi, I., Core-Based Cost Allocation in the Cooperative Traveling Salesman Problem, Eur. J. Operat. Res., 2016, vol. 248, no. 3, pp. 910\u2013916.","journal-title":"Eur. J. Operat. Res."},{"issue":"11","key":"1005_CR14","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1057\/palgrave.jors.2602489","volume":"59","author":"MA Krajewska","year":"2008","unstructured":"Krajewska, M.A., Kopfer, H., Laporte, G., Ropke, S., and Zaccour, G., Horizontal Cooperation among Freight Carriers: Request Allocation and Profit Sharing, J. Operat. Res. Soc., 2008, vol. 59, no. 11, pp. 1483\u20131491.","journal-title":"J. Operat. Res. Soc."},{"issue":"4","key":"1005_CR15","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S. and Pisinger, D., An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows, Transport. Sci., 2006, vol. 40, no. 4, pp. 455\u2013472.","journal-title":"Transport. Sci."},{"issue":"6","key":"1005_CR16","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1080\/01441647.2013.853706","volume":"33","author":"L Verdonck","year":"2003","unstructured":"Verdonck, L., Caris, A.N., Ramaekers, K., and Janssens, G.K., Collaborative Logistics from the Perspective of Road Transportation Companies, Transport Rev., 2003, vol. 33, no. 6, pp. 700\u2013719.","journal-title":"Transport Rev."},{"key":"1005_CR17","first-page":"641","volume":"434","author":"V Zakharov","year":"2014","unstructured":"Zakharov, V. and Krylatov, A., Equilibrium Assignments in Competitive and Cooperative Traffic Flow Routing, IFIP Adv. Inform. Commun. Techn., Springer, 2014, vol. 434, pp. 641\u2013648.","journal-title":"IFIP Adv. Inform. Commun. Techn."},{"issue":"5","key":"1005_CR18","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1134\/S0005117915050173","volume":"76","author":"VV Zakharov","year":"2015","unstructured":"Zakharov, V.V. and Shchegryaev, A.N., Stable Cooperation in Dynamic Vehicle Routing Problems, Autom. Remote Control, 2015, vol. 76, no. 5, pp. 935\u2013943.","journal-title":"Autom. Remote Control"},{"key":"1005_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s41604-017-0003-0","volume-title":"J. Vehicle Rout. Algorithms","author":"VV Zakharov","year":"2017","unstructured":"Zakharov, V.V. and Shirokikh, V.A., Heuristic Evaluation of the Characteristic Function in the Cooperative Inventory Routing Game, J. Vehicle Rout. Algorithms, 2017. https:\/\/doi.org\/10.1007\/s41604-017-0003-0"},{"key":"1005_CR20","unstructured":"http:\/\/www.leandro-coelho.com\/instances\/inventory-routing\/"}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117919070129.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117919070129","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117919070129.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:34:35Z","timestamp":1773614075000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117919070129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["1005"],"URL":"https:\/\/doi.org\/10.1134\/s0005117919070129","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"11 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}