{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T10:19:57Z","timestamp":1775038797225,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T00:00:00Z","timestamp":1764720000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T00:00:00Z","timestamp":1764720000000},"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":["CCF Trans. HPC"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s42514-025-00258-7","type":"journal-article","created":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T08:37:53Z","timestamp":1764751073000},"page":"210-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Accelerating TSA via SpMV-based GPU parallelization in the industrial chain context"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-1421-3947","authenticated-orcid":false,"given":"De","family":"Dong","sequence":"first","affiliation":[]},{"given":"Shurui","family":"Dai","sequence":"additional","affiliation":[]},{"given":"Nurbol","family":"Luktarhan","sequence":"additional","affiliation":[]},{"given":"Yicheng","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Guanyu","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Jiaxuan","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,3]]},"reference":[{"key":"258_CR1","doi-asserted-by":"crossref","unstructured":"Aminabadi, R.Y., Rajbhandari, S., Awan, A.A., Li, C., Li, D., Zheng, E., Ruwase, O., Smith, S., Zhang, M., Rasley, J., He, Y.: DeepSpeed- Inference: Enabling efficient inference of transformer models at unprecedented scale. In: SC22: International conference for high performance computing, networking, storage and analysis, pp. 1\u201315 (2022)","DOI":"10.1109\/SC41404.2022.00051"},{"issue":"5","key":"258_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.9790\/5728-0453942","volume":"4","author":"SA Aramuthakannan","year":"2013","unstructured":"Aramuthakannan, S.A.: Revised distribution method of finding optimal solution for transportation problems. IOSR J. Math. 4(5), 39\u201342 (2013)","journal-title":"IOSR J. Math."},{"key":"258_CR3","doi-asserted-by":"crossref","unstructured":"Bieling, J., Peschlow, P., Martini, P.: An efficient GPU implementation of the revised simplex method. In: 2010 IEEE International Symposium on parallel & distributed processing, workshops and Phd Forum (IPDPSW), pp. 1\u20138 (2010). IEEE","DOI":"10.1109\/IPDPSW.2010.5470831"},{"key":"258_CR4","doi-asserted-by":"crossref","unstructured":"Boyer, V., El\u00a0Baz, D., Salazar-Aguilar, M.: GPU Computing applied to linear and mixed integer programming, In: Sarbazi-Azad , H. (ed) Chapter 10 in advances in GPU, research and practice, . Morgan Kaufmann, Elsevier, Amsterdam Boston (2017)","DOI":"10.1016\/B978-0-12-803738-6.00010-0"},{"issue":"6","key":"258_CR5","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1080\/10556788.2016.1260568","volume":"32","author":"H Bulut","year":"2017","unstructured":"Bulut, H.: Multiloop transportation simplex algorithm. Optim. Methods Softw. 32(6), 1206\u20131217 (2017)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"258_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1057\/jors.1990.50","volume":"41","author":"SI Gass","year":"1990","unstructured":"Gass, S.I.: On solving the transportation problem. J. Oper. Res. Soc. 41(4), 291\u2013297 (1990)","journal-title":"J. Oper. Res. Soc."},{"issue":"5","key":"258_CR7","doi-asserted-by":"publisher","first-page":"804","DOI":"10.26599\/TST.2021.9010054","volume":"27","author":"Q Hua","year":"2022","unstructured":"Hua, Q., Chen, L., Li, P., Zhao, S., Li, Y.: A pixel-channel hybrid attention model for image processing. Tsinghua Sci. Technol. 27(5), 804\u2013816 (2022)","journal-title":"Tsinghua Sci. Technol."},{"issue":"3","key":"258_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/3543542","volume":"9","author":"Y Ji","year":"2022","unstructured":"Ji, Y., Liu, H., Hu, Y., Huang, H.H.: Ispan: parallel identification of strongly connected components with spanning trees. ACM Trans. Parallel Comput. 9(3), 13\u201311327 (2022)","journal-title":"ACM Trans. Parallel Comput."},{"key":"258_CR9","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1016\/j.asoc.2015.05.009","volume":"34","author":"ZAMS Juman","year":"2015","unstructured":"Juman, Z.A.M.S., Hoque, M.A.: An efficient heuristic to obtain a better initial feasible solution to the transportation problem. Appl. Soft Comput. 34, 813\u2013826 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"258_CR10","first-page":"370","volume":"16","author":"S Koruko\u011flu","year":"2011","unstructured":"Koruko\u011flu, S., Ball\u0131, S.: An improved vogel\u2019s approximation method for the transportation problem. Math. Comput. Appl. 16(2), 370\u2013381 (2011)","journal-title":"Math. Comput. Appl."},{"key":"258_CR11","doi-asserted-by":"crossref","unstructured":"Li, J., Lv, R., Hu, X., Jiang, Z.: A GPU-based parallel algorithm for large scale linear programming problem. In: Intelligent decision technologies: proceedings of the 3rd International conference on intelligent decision technologies (IDT\u20192011), pp. 37\u201346 (2011). Springer","DOI":"10.1007\/978-3-642-22194-1_4"},{"issue":"4","key":"258_CR12","first-page":"1","volume":"13","author":"T Liu","year":"2024","unstructured":"Liu, T., Yang, X., Zhou, H., Zhao, Z.: A survey of collaborative filtering recommender algorithms based on graph neural networks. J. Integr. Technol. 13(4), 1\u201315 (2024)","journal-title":"J. Integr. Technol."},{"key":"258_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2023.104790","volume":"184","author":"M Mahajan","year":"2024","unstructured":"Mahajan, M., Nagi, R.: Gpu-accelerated transportation simplex algorithm. J. Parallel Distrib. Comput. 184, 104790 (2024)","journal-title":"J. Parallel Distrib. Comput."},{"key":"258_CR14","doi-asserted-by":"crossref","unstructured":"Mishra, D.S.: Solving transportation problem by various methods and their comaprison. Int. J. Math. Trends Technol. IJMTT 44 (2017)","DOI":"10.14445\/22315373\/IJMTT-V44P538"},{"key":"258_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jss.2014.04.047","volume":"96","author":"N Ploskas","year":"2014","unstructured":"Ploskas, N., Samaras, N.: GPU accelerated pivoting rules for the simplex algorithm. J. Syst. Softw. 96, 1\u20139 (2014)","journal-title":"J. Syst. Softw."},{"issue":"4","key":"258_CR16","doi-asserted-by":"publisher","first-page":"12","DOI":"10.5539\/mas.v6n4p12","volume":"6","author":"SZ Ramadan","year":"2012","unstructured":"Ramadan, S.Z., Ramadan, I.Z.: Hybrid two-stage algorithm for solving transportation problem. Mod. Appl. Sci. 6(4), 12 (2012)","journal-title":"Mod. Appl. Sci."},{"key":"258_CR17","doi-asserted-by":"crossref","unstructured":"Shah, U.A., Yousaf, S.: Performance analysis of benchmarks for GPU-based linear programming problem solvers. 2019 2nd International conference on communication, computing and digital systems (C-CODE), pp. 132\u2013136 (2019). IEEE","DOI":"10.1109\/C-CODE.2019.8680981"},{"issue":"5","key":"258_CR18","first-page":"131","volume":"3","author":"V Sudhakar","year":"2010","unstructured":"Sudhakar, V., Kumar, V.N.: A new approach for finding an optimal solution for integer interval transportation problems. Int. J. Open Probl. Compt. Math 3(5), 131\u2013137 (2010)","journal-title":"Int. J. Open Probl. Compt. Math"},{"issue":"2","key":"258_CR19","first-page":"1","volume":"6","author":"MS Uddin","year":"2016","unstructured":"Uddin, M.S., Khan, A.R., Kibria, C.G., Raeva, I.: Improved least cost method to obtain a better IBFS to the transportation problem. J. Appl. Math. Bioinform. 6(2), 1 (2016)","journal-title":"J. Appl. Math. Bioinform."},{"issue":"5","key":"258_CR20","doi-asserted-by":"publisher","first-page":"916","DOI":"10.26599\/TST.2022.9010052","volume":"28","author":"W Yu","year":"2023","unstructured":"Yu, W., Liao, Y., Yang, Y.: Exact and approximation algorithms for the multi-depot capacitated arc routing problems. Tsinghua Sci. Technol. 28(5), 916\u2013928 (2023)","journal-title":"Tsinghua Sci. Technol."},{"key":"258_CR21","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.ins.2018.07.064","volume":"466","author":"Z Zhao","year":"2018","unstructured":"Zhao, Z., Liu, W., Qian, Y., Nie, L., Yin, Y., Zhang, Y.: Identifying advisor-advisee relationships from co-author networks via a novel deep model. Inf. Sci. 466, 258\u2013269 (2018)","journal-title":"Inf. Sci."}],"updated-by":[{"DOI":"10.1007\/s42514-026-00273-2","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T00:00:00Z","timestamp":1772409600000}}],"container-title":["CCF Transactions on High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-025-00258-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42514-025-00258-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-025-00258-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T08:08:21Z","timestamp":1775030901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42514-025-00258-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,3]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["258"],"URL":"https:\/\/doi.org\/10.1007\/s42514-025-00258-7","relation":{},"ISSN":["2524-4922","2524-4930"],"issn-type":[{"value":"2524-4922","type":"print"},{"value":"2524-4930","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,3]]},"assertion":[{"value":"8 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2026","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s42514-026-00273-2","URL":"https:\/\/doi.org\/10.1007\/s42514-026-00273-2","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}