{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T11:20:45Z","timestamp":1778757645504,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:00:00Z","timestamp":1771545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:00:00Z","timestamp":1771545600000},"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":["Int J Syst Assur Eng Manag"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s13198-025-03022-w","type":"journal-article","created":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T09:38:12Z","timestamp":1771580292000},"page":"1122-1132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph-theoretic solutions for transport network flow problems"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7728-0723","authenticated-orcid":false,"given":"Prag","family":"Singhal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shalini","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,20]]},"reference":[{"key":"3022_CR1","doi-asserted-by":"publisher","unstructured":"Ayed H, Khadraoui D, Habbas Z, Bouvry P, Merche JF (2008) Transfer graph approach for multimodal transport problems.communications in computer and information science, 14. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-87477-5_57.","DOI":"10.1007\/978-3-540-87477-5_57"},{"key":"3022_CR2","volume-title":"Applied combinatorial mathematics","author":"EF Beckenbach","year":"1958","unstructured":"Beckenbach EF (1958) Applied combinatorial mathematics. Wiley"},{"key":"3022_CR3","doi-asserted-by":"crossref","unstructured":"Bohman T, Frieze AM (2001) Arc-disjoint paths in expander digraphs. In: Proceedings of the 42nd annual IEEE symposium on foundations of computer science","DOI":"10.1109\/SFCS.2001.959932"},{"issue":"5","key":"3022_CR4","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1137\/S0097539792232021","volume":"23","author":"AZ Broder","year":"1994","unstructured":"Broder AZ, Frieze AM, Upfal E (1994) Existence and construction of edge-disjoint paths on expander graphs. SIAM J Comput 23(5):976\u2013989","journal-title":"SIAM J Comput"},{"key":"3022_CR5","doi-asserted-by":"crossref","unstructured":"Calinescu G, Chakrabarti A, Karloff H, Rabani Y (2002) Improved approximation algorithms for resource allocation. In: Proceedings of the 9th integer programming and combinatorial optimization conference.","DOI":"10.1007\/3-540-47867-1_28"},{"issue":"3","key":"3022_CR6","first-page":"503","volume":"91","author":"P Cappanera","year":"1996","unstructured":"Cappanera P, Gallo G (1996) A multi-commodity flow approach to the crew-restriction problem. Eur J Oper Res 91(3):503\u2013511","journal-title":"Eur J Oper Res"},{"issue":"4","key":"3022_CR7","first-page":"249","volume":"21","author":"S Even","year":"1975","unstructured":"Even S, Tarjan RE (1975) Network flow algorithms J. Comput Syst Sci 21(4):249\u2013265","journal-title":"Comput Syst Sci"},{"key":"3022_CR8","unstructured":"Fulkerson DR (1966) Flow networks and project cost curves. RAND Corporation."},{"issue":"4","key":"3022_CR9","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg AV, Tarjan RE (1988) A new approach to the maximum-flow problem. J ACM 35(4):921\u2013940","journal-title":"J ACM"},{"issue":"12","key":"3022_CR10","doi-asserted-by":"publisher","DOI":"10.3390\/a12120270","volume":"12","author":"S Guze","year":"2019","unstructured":"Guze S (2019) Graph theory approach to the vulnerability of transportation networks. Algorithms 12(12):270. https:\/\/doi.org\/10.3390\/a12120270","journal-title":"Algorithms"},{"key":"3022_CR11","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1108\/FS-01-2023-0016","volume":"27","author":"B Jin","year":"2025","unstructured":"Jin B, Xu X, Zhang Y (2025a) Peanut oil price change forecasts through the neural network. Foresight 27:595\u2013612. https:\/\/doi.org\/10.1108\/FS-01-2023-0016","journal-title":"Foresight"},{"issue":"2","key":"3022_CR12","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1108\/JM2-09-2023-0207","volume":"20","author":"B Jin","year":"2025","unstructured":"Jin B, Xu X, Zhang Y (2025b) Thermal coal futures trading volume predictions through the neural network\u00a0available to purchase. J Model Manag 20(2):585\u2013619. https:\/\/doi.org\/10.1108\/JM2-09-2023-0207","journal-title":"J Model Manag"},{"key":"3022_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.measen.2024.101060","volume":"33","author":"N Kalaivani","year":"2024","unstructured":"Kalaivani N, Visalakshidevi EM (2024) A generalized novel approach to transportation problem using multi partite-graph method. Meas Sensors 33:101060. https:\/\/doi.org\/10.1016\/j.measen.2024.101060","journal-title":"Meas Sensors"},{"issue":"8","key":"3022_CR14","first-page":"6327","volume":"9","author":"M Kanchana","year":"2020","unstructured":"Kanchana M, Kavitha K (2020) A review on transportation and smart logistics using graph theoretical approach. Adv Math: Sci J 9(8):6327\u20136339","journal-title":"Adv Math: Sci J"},{"issue":"2","key":"3022_CR15","first-page":"434","volume":"15","author":"AV Karzanov","year":"1974","unstructured":"Karzanov AV (1974) Determining the maximal flow in a network by the method of preflows. Sov Math Dokl 15(2):434\u2013437","journal-title":"Sov Math Dokl"},{"key":"3022_CR16","unstructured":"Kleinberg JM, Rubinfeld R (1996) Short paths in expander graphs. In: Proceedings of the 37th Annual IEEE symposium on foundations of computer science."},{"issue":"4","key":"3022_CR17","first-page":"452","volume":"37","author":"M Kumar","year":"2024","unstructured":"Kumar M, Agarwal VA (2024) Evaluation of Indian railway\u2019s supply chain parameters for improved sustainability under industry 4.0 transformation: an application of AHP and TOPSIS. Eng Manag J 37(4):452\u2013464","journal-title":"Eng Manag J"},{"key":"3022_CR18","first-page":"193","volume":"31","author":"M Kumar","year":"2024","unstructured":"Kumar M, Vipin AA (2024a) Application of AHP and TOPSIS for the evaluation of Indian railway supply chain parameters. Indian J Eng Mater Sci 31:193\u2013207","journal-title":"Indian J Eng Mater Sci"},{"key":"3022_CR19","doi-asserted-by":"publisher","unstructured":"Kumar M, Agarwal VA (2023) A compherehive study on supply chain management using artificial intelligence: an indian railway perspective. In: International conference on advancement in manufacturing engineering, 101\u2013108. https:\/\/doi.org\/10.1007\/978-981-99-1308-4_8.","DOI":"10.1007\/978-981-99-1308-4_8"},{"key":"3022_CR20","doi-asserted-by":"publisher","unstructured":"Kumar M, Agarwal VA (2023) A quantification of supply chain management factors using artificial intelligence. In: International conference on advancement in manufacturing engineering, 109\u2013116. https:\/\/doi.org\/10.1007\/978-981-99-1308-4_9.","DOI":"10.1007\/978-981-99-1308-4_9"},{"key":"3022_CR21","doi-asserted-by":"publisher","unstructured":"Kumar M, Agarwal VA (2024b) Supply chain management and its role in rail transport. In: E3S Web of Conferences 556, 01050. https:\/\/doi.org\/10.1051\/e3sconf\/202455601050.","DOI":"10.1051\/e3sconf\/202455601050"},{"issue":"11","key":"3022_CR22","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.22214\/ijraset.2022.47567","volume":"10","author":"M Nandhini","year":"2022","unstructured":"Nandhini M, Ramya M (2022) Application of graph theory to find minimal paths between two places for the transportation problem. Int J Res Appl Sci Eng Technol 10(11):1199\u20131205","journal-title":"Int J Res Appl Sci Eng Technol"},{"key":"3022_CR23","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cie.2016.07.030","volume":"99","author":"CD Nicholson","year":"2016","unstructured":"Nicholson CD, Zhang W (2016) Optimal network flow: a predictive analytics perspective on the fixed-charge network flow problem. Comput Ind Eng 99:260\u2013268","journal-title":"Comput Ind Eng"},{"key":"3022_CR24","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.trpro.2023.11.151","volume":"74","author":"M Peter","year":"2023","unstructured":"Peter M, Radovan M (2023) Transportation problems and their solutions: literature review. Transp Res Procedia 74:323\u2013329","journal-title":"Transp Res Procedia"},{"issue":"8","key":"3022_CR25","doi-asserted-by":"publisher","first-page":"2515","DOI":"10.1109\/TITS.2017.2752202","volume":"19","author":"S Pourazarm","year":"2018","unstructured":"Pourazarm S, Cassandras CG (2018) Optimal routing of energy-aware vehicles in transportation networks with inhomogeneous charging nodes. IEEE Trans Intell Transp Syst 19(8):2515\u20132527","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"10","key":"3022_CR26","first-page":"61","volume":"65","author":"T Priyadharshini","year":"2019","unstructured":"Priyadharshini T, Manikandan KM (2019) Application of graph theory to find optimal path and minimized cost for the transportation problem. Int J Math Trends Technol 65(10):61\u201369","journal-title":"Int J Math Trends Technol"},{"key":"3022_CR27","doi-asserted-by":"crossref","unstructured":"Rosdahl C, Nilsson G, Como G (2018) On distributed optimal control of traffic flows in transportation networks. In: Proceedings of the IEEE conference on control technology and applications.","DOI":"10.1109\/CCTA.2018.8511601"},{"key":"3022_CR28","volume-title":"Graph theory and network flows","author":"M Sierer","year":"1982","unstructured":"Sierer M (1982) Graph theory and network flows. Academic Press"},{"key":"3022_CR29","volume-title":"Finding paths in networks","author":"NJA Sloane","year":"1975","unstructured":"Sloane NJA (1975) Finding paths in networks. Princeton University Press"},{"issue":"2","key":"3022_CR30","first-page":"27","volume":"1","author":"M Stavara","year":"2024","unstructured":"Stavara M, Tsiotas D (2024) A Combined graph theoretic and transport planning framework for the economic and functional analysis of large-scale road networks. Sustain Region Dev Sci J 1(2):27\u201339","journal-title":"Sustain Region Dev Sci J"},{"issue":"6","key":"3022_CR31","doi-asserted-by":"publisher","DOI":"10.3390\/su17062486","volume":"17","author":"B Syzdykbayeva","year":"2025","unstructured":"Syzdykbayeva B, Raimbekov Z, Baiburiev R, Dulatbekova Z (2025) Improving the transport and logistic infrastructure of a city using the graph theory method: the case of Astana, Kazakhstan. Sustainability 17(6):2486. https:\/\/doi.org\/10.3390\/su17062486","journal-title":"Sustainability"},{"key":"3022_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.mlwa.2021.100140","volume":"6","author":"X Xu","year":"2021","unstructured":"Xu X, Zhang Y (2021) Network analysis of corn cash price comovements. Mach Learn Appl 6:100140. https:\/\/doi.org\/10.1016\/j.mlwa.2021.100140","journal-title":"Mach Learn Appl"},{"key":"3022_CR33","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1017\/nie.2021.34","volume":"264","author":"X Xu","year":"2023","unstructured":"Xu X, Zhang Y (2023) Network analysis of housing price comovements of a hundred Chinese cities, Cambridge University Press. Natl Inst Econ Rev 264:110\u2013128. https:\/\/doi.org\/10.1017\/nie.2021.34","journal-title":"Natl Inst Econ Rev"},{"issue":"3","key":"3022_CR34","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1108\/IJHMA-09-2022-0134","volume":"17","author":"X Xu","year":"2024","unstructured":"Xu X, Zhang Y (2024a) Network analysis of comovements among newly-built residential house price indices of seventy Chinese cities. Int J Hous Mark Anal 17(3):726\u2013749. https:\/\/doi.org\/10.1108\/IJHMA-09-2022-0134","journal-title":"Int J Hous Mark Anal"},{"issue":"1","key":"3022_CR35","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1515\/jafio-2022-0009","volume":"22","author":"X Xu","year":"2024","unstructured":"Xu X, Zhang Y (2024b) Network analysis of price comovements among corn futures and cash prices. J Agric Food Ind Org 22(1):53\u201381. https:\/\/doi.org\/10.1515\/jafio-2022-0009","journal-title":"J Agric Food Ind Org"}],"container-title":["International Journal of System Assurance Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-025-03022-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13198-025-03022-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-025-03022-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T10:34:46Z","timestamp":1778754886000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13198-025-03022-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,20]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["3022"],"URL":"https:\/\/doi.org\/10.1007\/s13198-025-03022-w","relation":{},"ISSN":["0975-6809","0976-4348"],"issn-type":[{"value":"0975-6809","type":"print"},{"value":"0976-4348","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,20]]},"assertion":[{"value":"5 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}