{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T17:29:12Z","timestamp":1780421352381,"version":"3.54.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T00:00:00Z","timestamp":1689206400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T00:00:00Z","timestamp":1689206400000},"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":["Optim Lett"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s11590-023-02040-6","type":"journal-article","created":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T17:02:00Z","timestamp":1689267720000},"page":"1131-1149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A sequential reduction algorithm for the large-scale fixed-charge network flow problems"],"prefix":"10.1007","volume":"18","author":[{"given":"Lu","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhouwang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,13]]},"reference":[{"issue":"1","key":"2040_CR1","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s00521-017-3027-3","volume":"31","author":"S Sadeghi-Moghaddam","year":"2019","unstructured":"Sadeghi-Moghaddam, S., Hajiaghaei-Keshteli, M., Mahmoodjanloo, M.: New approaches in metaheuristics to solve the fixed charge transportation problem in a fuzzy environment. Neural Comput. Appl. 31(1), 477\u2013497 (2019). https:\/\/doi.org\/10.1007\/s00521-017-3027-3","journal-title":"Neural Comput. Appl."},{"key":"2040_CR2","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.cie.2014.05.026","volume":"74","author":"M Hajiaghaei-Keshteli","year":"2014","unstructured":"Hajiaghaei-Keshteli, M., Aminnayeri, M., Ghomi, S.F.: Integrated scheduling of production and rail transportation. Comput. Ind. Eng. 74, 240\u2013256 (2014). https:\/\/doi.org\/10.1016\/j.cie.2014.05.026","journal-title":"Comput. Ind. Eng."},{"issue":"5\u20136","key":"2040_CR3","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1016\/j.endm.2017.03.019","volume":"57","author":"S Molla-Alizadeh-Zavardehi","year":"2013","unstructured":"Molla-Alizadeh-Zavardehi, S., Nezhad, S.S., Tavakkoli-Moghaddam, R., Yazdani, M.: Solving a fuzzy fixed charge solid transportation problem by metaheuristics. Math. Comput. Model. 57(5\u20136), 1543\u20131558 (2013). https:\/\/doi.org\/10.1016\/j.endm.2017.03.019","journal-title":"Math. Comput. Model."},{"key":"2040_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.endm.2017.03.019","volume":"58","author":"S Golmohamadi","year":"2017","unstructured":"Golmohamadi, S., Tavakkoli-Moghaddam, R., Hajiaghaei-Keshteli, M.: Solving a fuzzy fixed charge solid transportation problem using batch transferring by new approaches in meta-heuristic. Electron. Notes Discret. Math. 58, 143\u2013150 (2017). https:\/\/doi.org\/10.1016\/j.endm.2017.03.019","journal-title":"Electron. Notes Discret. Math."},{"issue":"1","key":"2040_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/net.20383","volume":"57","author":"L Moccia","year":"2011","unstructured":"Moccia, L., Cordeau, J.-F., Laporte, G., Ropke, S., Valentini, M.P.: Modeling and solving a multimodal transportation problem with flexible-time and scheduled services. Networks 57(1), 53\u201368 (2011). https:\/\/doi.org\/10.1002\/net.20383","journal-title":"Networks"},{"key":"2040_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.watres.2021.117390","volume":"202","author":"J Willet","year":"2021","unstructured":"Willet, J., Wetser, K., Dykstra, J.E., Bianchi, A.B., Essink, G.H.O., Rijnaarts, H.H.: Waterroute: a model for cost optimization of industrial water supply networks when using water resources with varying salinity. Water Res. 202, 117390 (2021). https:\/\/doi.org\/10.1016\/j.watres.2021.117390","journal-title":"Water Res."},{"issue":"3","key":"2040_CR7","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/nav.3800150306","volume":"15","author":"WM Hirsch","year":"1968","unstructured":"Hirsch, W.M., Dantzig, G.B.: The fixed charge problem. Naval Res. Logist. Q. 15(3), 413\u2013424 (1968). https:\/\/doi.org\/10.1002\/nav.3800150306","journal-title":"Naval Res. Logist. Q."},{"key":"2040_CR8","first-page":"111","volume":"20","author":"M J\u00fcnger","year":"1995","unstructured":"J\u00fcnger, M., Reinelt, G., Thienel, S.: Cutting plane algorithms. Comb. Optim. Papers DIMACS Special Year 20, 111 (1995)","journal-title":"Comb. Optim. Papers DIMACS Special Year"},{"issue":"6","key":"2040_CR9","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1016\/j.cor.2003.11.012","volume":"32","author":"AM Costa","year":"2005","unstructured":"Costa, A.M.: A survey on benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res. 32(6), 1429\u20131450 (2005). https:\/\/doi.org\/10.1016\/j.cor.2003.11.012","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"2040_CR10","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10898-018-0661-y","volume":"72","author":"Y Zhao","year":"2018","unstructured":"Zhao, Y., Larsson, T., R\u00f6nnberg, E., Pardalos, P.M.: The fixed charge transportation problem: a strong formulation based on lagrangian decomposition and column generation. J. Glob. Optim. 72(3), 517\u2013538 (2018). https:\/\/doi.org\/10.1007\/s10898-018-0661-y","journal-title":"J. Glob. Optim."},{"issue":"1","key":"2040_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10479-008-0483-2","volume":"172","author":"J S\u00e1ez Aguado","year":"2009","unstructured":"S\u00e1ez Aguado, J.: Fixed charge transportation problems: a new heuristic approach based on lagrangean relaxation and the solving of core problems. Ann. Oper. Res. 172(1), 45\u201369 (2009). https:\/\/doi.org\/10.1007\/s10479-008-0483-2","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"2040_CR12","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.orl.2005.05.009","volume":"34","author":"F Vanderbeck","year":"2006","unstructured":"Vanderbeck, F., Savelsbergh, M.W.: A generic view of Dantzig\u2013Wolfe decomposition in mixed integer programming. Oper. Res. Lett. 34(3), 296\u2013306 (2006). https:\/\/doi.org\/10.1016\/j.orl.2005.05.009","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"2040_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","volume":"24","author":"D Kim","year":"1999","unstructured":"Kim, D., Pardalos, P.M.: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24(4), 195\u2013203 (1999). https:\/\/doi.org\/10.1016\/S0167-6377(99)00004-8","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"2040_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.3934\/jimo.2007.3.71","volume":"3","author":"A Nahapetyan","year":"2007","unstructured":"Nahapetyan, A., Pardalos, P.M.: A bilinear relaxation based algorithm for concave piecewise linear network flow problems. J. Ind. Manag. Optim. 3(1), 71 (2007). https:\/\/doi.org\/10.3934\/jimo.2007.3.71","journal-title":"J. Ind. Manag. Optim."},{"issue":"3","key":"2040_CR15","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11590-009-0114-0","volume":"3","author":"S Rebennack","year":"2009","unstructured":"Rebennack, S., Nahapetyan, A., Pardalos, P.M.: Bilinear modeling solution approach for fixed charge network flow problems. Optim. Lett. 3(3), 347\u2013355 (2009). https:\/\/doi.org\/10.1007\/s11590-009-0114-0","journal-title":"Optim. Lett."},{"issue":"3","key":"2040_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0305-0483(03)00025-2","volume":"31","author":"V Adlakha","year":"2003","unstructured":"Adlakha, V., Kowalski, K.: A simple heuristic for solving small fixed-charge transportation problems. Omega 31(3), 205\u2013211 (2003). https:\/\/doi.org\/10.1016\/S0305-0483(03)00025-2","journal-title":"Omega"},{"issue":"2","key":"2040_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10614-006-9028-4","volume":"27","author":"D Kim","year":"2006","unstructured":"Kim, D., Pan, X., Pardalos, P.M.: An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems. Comput. Econ. 27(2), 273\u2013293 (2006). https:\/\/doi.org\/10.1007\/s10614-006-9028-4","journal-title":"Comput. Econ."},{"issue":"1","key":"2040_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10589-007-9060-x","volume":"39","author":"A Nahapetyan","year":"2008","unstructured":"Nahapetyan, A., Pardalos, P.: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems. Comput. Optim. Appl. 39(1), 37\u201350 (2008). https:\/\/doi.org\/10.1007\/s10589-007-9060-x","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2040_CR19","doi-asserted-by":"publisher","first-page":"11231","DOI":"10.1016\/j.ifacol.2020.12.344","volume":"53","author":"Z Nie","year":"2020","unstructured":"Nie, Z., Wang, S.: A dynamic method to solve the fixed charge network flow problem. IFAC-PapersOnLine 53(2), 11231\u201311236 (2020). https:\/\/doi.org\/10.1016\/j.ifacol.2020.12.344","journal-title":"IFAC-PapersOnLine"},{"issue":"3","key":"2040_CR20","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"AV Goldberg","year":"1990","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by successive approximation. Math. Oper. Res. 15(3), 430\u2013466 (1990). https:\/\/doi.org\/10.1287\/moor.15.3.430","journal-title":"Math. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02040-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-02040-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02040-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T03:35:28Z","timestamp":1716003328000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-02040-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,13]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2040"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-02040-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,13]]},"assertion":[{"value":"2 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declared that there is no confict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}