{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T11:35:47Z","timestamp":1770896147087,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T00:00:00Z","timestamp":1229385600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s10287-008-0086-z","type":"journal-article","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T15:30:28Z","timestamp":1229355028000},"page":"251-267","source":"Crossref","is-referenced-by-count":22,"title":["Stochastic optimization models for a single-sink transportation problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Francesca","family":"Maggioni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Kaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Bertazzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,16]]},"reference":[{"issue":"1","key":"86_CR1","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1287\/trsc.1030.0055","volume":"39","author":"B Alidaee","year":"2005","unstructured":"Alidaee B, Kochenberger GA (2005) A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem. Transp Sci 39(1): 140\u2013143","journal-title":"Transp Sci"},{"key":"86_CR2","volume-title":"Introduction to stochastic programming","author":"JR Birge","year":"1997","unstructured":"Birge JR, Louveaux F (1997) Introduction to stochastic programming. Springer, New York"},{"key":"86_CR3","unstructured":"Dupa\u010dov\u00e1 J (1997) Stochastic programming: approximation via scenarios. In: Proceedings of the 3rd international conference on approximation and optimization in the caribbean. Benem\u00e9rita Universidad Aut\u00f3noma de Puebla, Puebla, Mexico. http:\/\/www.emis.de\/proceedings\/3ICAOC\/index.html"},{"issue":"1\u20134","key":"86_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1023\/A:1019206915174","volume":"100","author":"J Dupa\u010dov\u00e1","year":"2000","unstructured":"Dupa\u010dov\u00e1 J, Consigli G, Wallace SW (2000) Scenarios for multistage stochastic programs. Ann Oper Res 100(1\u20134): 25\u201353","journal-title":"Ann Oper Res"},{"key":"86_CR5","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1287\/trsc.30.4.276","volume":"30","author":"YT Herer","year":"1996","unstructured":"Herer YT, Rosenblatt MJ, Hefter I (1996) Fast algorithms for single-sink fixed charge transportation problems with applications to manufacturing and transportation. Transp Sci 30: 276\u2013290","journal-title":"Transp Sci"},{"key":"86_CR6","volume-title":"Stochastic programming","author":"P Kall","year":"1994","unstructured":"Kall P, Wallace SW (1994) Stochastic programming. Wiley, Chichester"},{"issue":"2","key":"86_CR7","first-page":"257","volume":"3","author":"M Kaut","year":"2007","unstructured":"Kaut M, Wallace SW (2007) Evaluation of scenario generation methods for stochastic programming. Pac J Optim 3(2): 257\u2013271","journal-title":"Pac J Optim"},{"issue":"10","key":"86_CR8","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1287\/mnsc.43.10.1431","volume":"43","author":"BW Lamar","year":"1997","unstructured":"Lamar BW, Wallace CA (1997) Revised-modified penalties for fixed charge transportation problems. Manage Sci 43(10): 1431\u20131436","journal-title":"Manage Sci"},{"issue":"4","key":"86_CR9","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/opre.38.4.704","volume":"38","author":"BW Lamar","year":"1990","unstructured":"Lamar BW, Sheffi Y, Powell WB (1990) A capacity improvement lower bound for fixed charge network design problmes. Oper Res 38(4): 704\u2013710","journal-title":"Oper Res"},{"issue":"9","key":"86_CR10","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1287\/mnsc.36.9.1092","volume":"36","author":"US Palekar","year":"1990","unstructured":"Palekar US, Karwan MH, Zionts S (1990) A branch-and-bound method for the fixed charge transportation problem. Manage Sci 36(9): 1092\u20131105","journal-title":"Manage Sci"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-008-0086-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-008-0086-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-008-0086-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:12:47Z","timestamp":1559117567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-008-0086-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,16]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["86"],"URL":"https:\/\/doi.org\/10.1007\/s10287-008-0086-z","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,16]]}}}