{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T11:37:27Z","timestamp":1763552247295,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T00:00:00Z","timestamp":1676073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T00:00:00Z","timestamp":1676073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["2017-06054","2021-00028"],"award-info":[{"award-number":["2017-06054","2021-00028"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10107-023-01930-y","type":"journal-article","created":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T11:53:50Z","timestamp":1676116430000},"page":"169-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A novel reformulation for the single-sink fixed-charge transportation problem"],"prefix":"10.1007","volume":"202","author":[{"given":"Robin","family":"Legault","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6437-7638","authenticated-orcid":false,"given":"Jean-Fran\u00e7ois","family":"C\u00f4t\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Gendron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,11]]},"reference":[{"key":"1930_CR1","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1287\/trsc.30.4.276","volume":"30","author":"YT Herer","year":"1996","unstructured":"Herer, Y.T., Rosenblatt, M.J., Hefter, I.: Fast algorithms for single-sink fixed charge transportation problems with applications to manufacturing and transportation. Transp. Sci. 30, 276\u2013290 (1996)","journal-title":"Transp. Sci."},{"issue":"6","key":"1930_CR2","doi-asserted-by":"publisher","first-page":"2079","DOI":"10.1016\/j.cor.2006.10.011","volume":"35","author":"A Klose","year":"2008","unstructured":"Klose, A.: Algorithms for solving the single-sink fixed-charge transportation problem. Comput. Oper. Res. 35(6), 2079\u20132092 (2008)","journal-title":"Comput. Oper. Res."},{"key":"1930_CR3","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-7908-1921-2_19","volume-title":"Management logistischer Netzwerke","author":"S G\u00f6rtz","year":"2007","unstructured":"G\u00f6rtz, S., Klose, A.: The single-sink fixed-charge transportation problem: Applications and solution methods. In: G\u00fcnther, H.-O., Mattfeld, D.C., Suhl, L. (eds.) Management logistischer Netzwerke, pp. 383\u2013406. Physica-Verlag HD, Heidelberg (2007)"},{"issue":"2","key":"1930_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/trsc.2017.0742","volume":"52","author":"A Mingozzi","year":"2018","unstructured":"Mingozzi, A., Roberti, R.: An exact algorithm for the fixed charge transportation problem based on matching source and sink patterns. Transp. Sci. 52(2), 229\u2013238 (2018)","journal-title":"Transp. Sci."},{"issue":"3","key":"1930_CR5","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1287\/trsc.1120.0431","volume":"47","author":"TRL Christensen","year":"2013","unstructured":"Christensen, T.R.L., Andersen, K.A., Klose, A.: Solving the single-sink, fixed-charge, multiple-choice transportation problem by dynamic programming. Transp. Sci. 47(3), 428\u2013438 (2013)","journal-title":"Transp. Sci."},{"issue":"C","key":"1930_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.dam.2020.12.024","volume":"308","author":"MRA Kazemzadeh","year":"2022","unstructured":"Kazemzadeh, M.R.A., Bekta\u015f, T., Crainic, T.G., Frangioni, A., Gendron, B., Gorgone, E.: Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design. Discrete Appl. Math. 308(C), 255\u2013275 (2022)","journal-title":"Discrete Appl. Math."},{"key":"1930_CR7","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/BF00940686","volume":"69","author":"J Haberl","year":"1991","unstructured":"Haberl, J.: Exact algorithm for solving a special fixed-charge linear programming problem. J. Optim. Theory Appl. 69, 489\u2013529 (1991)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1930_CR8","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1287\/trsc.1030.0055","volume":"39","author":"B Alidaee","year":"2005","unstructured":"Alidaee, B., Kochenberger, G.A.: A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem. Transp. Sci. 39(1), 140\u2013143 (2005)","journal-title":"Transp. Sci."},{"issue":"3","key":"1930_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0377-2217(77)90024-8","volume":"1","author":"S Martello","year":"1977","unstructured":"Martello, S., Toth, P.: An upper bound for the zero-one knapsack problem and a branch and bound algorithm. Euro. J. Oper. Res. 1(3), 169\u2013175 (1977)","journal-title":"Euro. J. Oper. Res."},{"issue":"5","key":"1930_CR10","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1287\/opre.45.5.768","volume":"45","author":"S Martello","year":"1997","unstructured":"Martello, S., Toth, P.: Upper bounds and algorithms for hard 0\u20131 knapsack problems. Oper. Res. 45(5), 768\u2013778 (1997)","journal-title":"Oper. Res."},{"issue":"5","key":"1930_CR11","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D Pisinger","year":"1997","unstructured":"Pisinger, D.: A minimal algorithm for the 0\u20131 knapsack problem. Oper. Res. 45(5), 758\u2013767 (1997)","journal-title":"Oper. Res."},{"issue":"1","key":"1930_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1287\/ijoc.12.1.75.11898","volume":"12","author":"D Pisinger","year":"2000","unstructured":"Pisinger, D.: A minimal algorithm for the bounded knapsack problem. INFORMS J. Comput. 12(1), 75\u201382 (2000)","journal-title":"INFORMS J. Comput."},{"issue":"11\u2013part\u20132","key":"1930_CR13","doi-asserted-by":"publisher","first-page":"S96","DOI":"10.1287\/mnsc.44.11.S96","volume":"44","author":"MJ Rosenblatt","year":"1998","unstructured":"Rosenblatt, M.J., Herer, Y.T., Hefter, I.: Note: an acquisition policy for a single item multi-supplier system. Manag. Sci. 44(11\u2013part\u20132), S96\u2013S100 (1998)","journal-title":"Manag. Sci."},{"issue":"5","key":"1930_CR14","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problems. Oper. Res. 28(5), 1130\u20131154 (1980)","journal-title":"Oper. Res."},{"issue":"4","key":"1930_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10732-007-9065-8","volume":"15","author":"S G\u00f6rtz","year":"2009","unstructured":"G\u00f6rtz, S., Klose, A.: Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem. J. Heuristics 15(4), 331\u2013349 (2009)","journal-title":"J. Heuristics"},{"key":"1930_CR16","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)"},{"issue":"3","key":"1930_CR17","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Manage. Sci. 45(3), 414\u2013424 (1999)","journal-title":"Manage. Sci."},{"issue":"9","key":"1930_CR18","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger, D.: Where are the hard knapsack problems? Comput. Oper. Res. 32(9), 2271\u20132284 (2005)","journal-title":"Comput. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01930-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-01930-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01930-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T19:50:15Z","timestamp":1697053815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-01930-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,11]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1930"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-01930-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2023,2,11]]},"assertion":[{"value":"2 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}