{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T06:02:30Z","timestamp":1759730550866},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T00:00:00Z","timestamp":1183420800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2008,1]]},"DOI":"10.1007\/s10589-007-9060-x","type":"journal-article","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T12:45:57Z","timestamp":1183380357000},"page":"37-50","source":"Crossref","is-referenced-by-count":25,"title":["Adaptive dynamic cost updating procedure for solving fixed charge network flow problems"],"prefix":"10.1007","volume":"39","author":[{"given":"Artyom","family":"Nahapetyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,3]]},"reference":[{"key":"9060_CR1","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1287\/opre.29.3.448","volume":"29","author":"R. Barr","year":"1981","unstructured":"Barr, R., Glover, F., Klingman, D.: A new optimization method for large scale fixed charge transportation problems. Oper. Res. 29, 448\u2013463 (1981)","journal-title":"Oper. Res."},{"key":"9060_CR2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/nav.3800310115","volume":"31","author":"A. Cabot","year":"1984","unstructured":"Cabot, A., Erenguc, S.: Some branch-and-bound procedures for fixed-cost transportation problems. Nav. Res. Log. Q. 31, 145\u2013154 (1984)","journal-title":"Nav. Res. Log. Q."},{"key":"9060_CR3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/nav.3800140110","volume":"14","author":"L. Cooper","year":"1967","unstructured":"Cooper, L., Drebes, C.: An approximate solution method for the fixed charge problem. Nav. Res. Log. Q. 14, 101\u2013113 (1967)","journal-title":"Nav. Res. Log. Q."},{"key":"9060_CR4","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1057\/jors.1991.189","volume":"42","author":"M. Diaby","year":"1991","unstructured":"Diaby, M.: Successive linear approximation procedure for generalized fixed-charge transportation problem. J. Oper. Res. Soc. 42, 991\u20131001 (1991)","journal-title":"J. Oper. Res. Soc."},{"key":"9060_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/b137269","volume-title":"Supply Chain Optimization","author":"J. Geunes","year":"2005","unstructured":"Geunes, J., Pardalos, P.: Supply Chain Optimization. Springer, Berlin (2005)"},{"key":"9060_CR6","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1287\/opre.19.6.1529","volume":"19","author":"P. Gray","year":"1971","unstructured":"Gray, P.: Exact solution for the fixed-charge transportation problem. Oper. Res. 19, 1529\u20131538 (1971)","journal-title":"Oper. Res."},{"key":"9060_CR7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02283688","volume":"25","author":"G. Guisewite","year":"1990","unstructured":"Guisewite, G., Pardalos, P.: Minimum concave-cost network flow problems: applications, complexity, and algorithms. Ann. Oper. Res. 25, 75\u2013100 (1990)","journal-title":"Ann. Oper. Res."},{"key":"9060_CR8","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/nav.3800150306","volume":"15","author":"W. Hirsch","year":"1968","unstructured":"Hirsch, W., Dantzig, G.: The fixed charge problem. Nav. Res. Log. Q. 15, 413\u2013424 (1968)","journal-title":"Nav. Res. Log. Q."},{"key":"9060_CR9","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1287\/mnsc.22.10.1116","volume":"22","author":"J. Kennington","year":"1976","unstructured":"Kennington, J., Unger, V.: A new branch-and-bound algorithm for the fixed charge transportation problem. Manag. Sci. 22, 1116\u20131126 (1976)","journal-title":"Manag. Sci."},{"key":"9060_CR10","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1002\/net.3230210606","volume":"21","author":"D. Khang","year":"1991","unstructured":"Khang, D., Fujiwara, O.: Approximate solution of capacitated fixed-charge minimum cost network flow problems. Networks 21, 689\u2013704 (1991)","journal-title":"Networks"},{"key":"9060_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","volume":"24","author":"D. Kim","year":"1999","unstructured":"Kim, D., Pardalos, P.: A solution approach to the fixed charged network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24, 195\u2013203 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"9060_CR12","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/(SICI)1097-0037(200005)35:3<216::AID-NET5>3.0.CO;2-E","volume":"35","author":"D. Kim","year":"2000","unstructured":"Kim, D., Pardalos, P.: Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems. Networks 35(3), 216\u2013222 (2000)","journal-title":"Networks"},{"key":"9060_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/nav.3800090102","volume":"9","author":"H. Kuhn","year":"1962","unstructured":"Kuhn, H., Baumol, W.: An approximate algorithm for the fixed charge transportation problem. Nav. Res. Log. Q. 9, 1\u201315 (1962)","journal-title":"Nav. Res. Log. Q."},{"key":"9060_CR14","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/opre.16.2.268","volume":"16","author":"K. Murty","year":"1968","unstructured":"Murty, K.: Solving the fixed charge problem by ranking the extreme points. Oper. Res. 16, 268\u2013279 (1968)","journal-title":"Oper. Res."},{"key":"9060_CR15","doi-asserted-by":"crossref","first-page":"71","DOI":"10.3934\/jimo.2007.3.71","volume":"3","author":"A. Nahapetyan","year":"2007","unstructured":"Nahapetyan, A., Pardalos, P.: A bilinear relaxation based algorithm for concave piecewise linear network flow problems. J. Ind. Manag. Optim. 3, 71\u201385 (2007)","journal-title":"J. Ind. Manag. Optim."},{"key":"9060_CR16","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1287\/mnsc.36.9.1092","volume":"36","author":"U. Palekar","year":"1990","unstructured":"Palekar, U., Karwan, M., Zionts, S.: A branch-and-bound method for fixed charge transportation problem. Manag. Sci. 36, 1092\u20131105 (1990)","journal-title":"Manag. Sci."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9060-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9060-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9060-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:32Z","timestamp":1559288192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9060-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,3]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["9060"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9060-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,3]]}}}