{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:28:16Z","timestamp":1742398096893},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T00:00:00Z","timestamp":1193702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s10732-007-9065-8","type":"journal-article","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T14:49:44Z","timestamp":1193669384000},"page":"331-349","source":"Crossref","is-referenced-by-count":9,"title":["Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Simon","family":"G\u00f6rtz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Klose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,30]]},"reference":[{"key":"9065_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, G.A.: A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem. Transp. Sci. 39, 140\u2013143 (2005)","journal-title":"Transp. Sci."},{"key":"9065_CR2","doi-asserted-by":"crossref","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, 1130\u20131154 (1980)","journal-title":"Oper. Res."},{"key":"9065_CR3","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/S0377-2217(02)00407-1","volume":"148","author":"S.S. Chauhan","year":"2003","unstructured":"Chauhan, S.S., Proth, J.-M.: The concave cost supply problem. Eur. J. Oper. Res. 148, 374\u2013383 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9065_CR4","unstructured":"Chauhan, S.S., Eremeev, A.V., Romanova, A.A., Servakh, V.V.: Approximation of linear cost supply management problem with lower-bounded demands. In: Proceedings of Discrete Optimization Methods in Production and Logistics, Nasledie Dialog-Sibir Pbs., Omsk, pp. 16\u201321, 2004"},{"key":"9065_CR5","first-page":"15","volume":"10","author":"J. Csirik","year":"1991","unstructured":"Csirik, J., Frenk, J.B.G., Labb\u00e9, M., Zhang, S.: Heuristics for the 0-1 min-knapsack problem. Acta Cybern. 10, 15\u201320 (1991)","journal-title":"Acta Cybern."},{"key":"9065_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-09526-8_26","volume-title":"Mathematical Foundations of Computer Science","author":"G.V. Gens","year":"1979","unstructured":"Gens, G.V., Levner, E.V.: Computational complexity of approximation algorithms for combinatorial problems. In: Becv\u00e1r, J. (ed.) Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 74, pp. 292\u2013300. Springer, Berlin (1979)"},{"key":"9065_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0167-6377(99)00066-8","volume":"26","author":"M.M. G\u00fcntzer","year":"2000","unstructured":"G\u00fcntzer, M.M., Jungnickel, D.: Approximate minimization algorithms for the 0\/1 knapsack and subset-sum problem. Oper. Res. Lett. 26, 55\u201366 (2000)","journal-title":"Oper. Res. Lett."},{"key":"9065_CR8","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1287\/trsc.30.4.276","volume":"30","author":"Y.T. 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."},{"key":"9065_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"9065_CR10","doi-asserted-by":"crossref","unstructured":"Klose, A.: Algorithms for solving the single-sink fixed-charge transportation problem. Comput. Oper. Res. (2006), doi: 10.1016\/j.cor.2006.10.011","DOI":"10.1016\/j.cor.2006.10.011"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9065-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-007-9065-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9065-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:29Z","timestamp":1559256869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-007-9065-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,30]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["9065"],"URL":"https:\/\/doi.org\/10.1007\/s10732-007-9065-8","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,30]]}}}