{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T19:38:21Z","timestamp":1648841901593},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,10,16]],"date-time":"2013-10-16T00:00:00Z","timestamp":1381881600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10957-013-0437-y","type":"journal-article","created":{"date-parts":[[2013,10,16]],"date-time":"2013-10-16T00:58:26Z","timestamp":1381885106000},"page":"1026-1038","source":"Crossref","is-referenced-by-count":1,"title":["Fractional Polynomial Bounds for the Fixed Charge Problem"],"prefix":"10.1007","volume":"164","author":[{"given":"V.","family":"Adlakha","sequence":"first","affiliation":[]},{"given":"K.","family":"Kowalski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,16]]},"reference":[{"key":"437_CR1","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/opre.16.2.268","volume":"16","author":"K.G. Murty","year":"1968","unstructured":"Murty, K.G.: Solving the fixed charge problem by ranking the extreme points. Oper. Res. 16, 268\u2013279 (1968)","journal-title":"Oper. Res."},{"key":"437_CR2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF00934768","volume":"37","author":"S. Sadagopan","year":"1982","unstructured":"Sadagopan, S., Ravindran, A.: A vertex ranking algorithm for the fixed-charge transportation problem. J. Optim. Theory Appl. 37, 221\u2013230 (1982)","journal-title":"J. Optim. Theory Appl."},{"key":"437_CR3","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1287\/mnsc.36.9.1092","volume":"36","author":"U.S. Palekar","year":"1990","unstructured":"Palekar, U.S., Karwan, M.H., Zionts, S.: A branch-and-bound method for the fixed charge transportation problem. Manag. Sci. 36, 1092\u20131105 (1990)","journal-title":"Manag. Sci."},{"key":"437_CR4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/nav.3800170209","volume":"17","author":"D.I. Steinberg","year":"1970","unstructured":"Steinberg, D.I.: The fixed charge problem. Nav. Res. Logist. Q. 17, 217\u2013235 (1970)","journal-title":"Nav. Res. Logist. Q."},{"key":"437_CR5","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF03398770","volume":"43","author":"V. Adlakha","year":"2006","unstructured":"Adlakha, V., Kowalski, K., Vemuganti, R.R.: Heuristic algorithms for the fixed-charge transportation problem. Opsearch 43, 88\u2013108 (2006)","journal-title":"Opsearch"},{"key":"437_CR6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0898-1221(75)90010-3","volume":"1","author":"L. Cooper","year":"1975","unstructured":"Cooper, L.: The fixed charge problem\u2014I: a new heuristic method. Comput. Math. Appl. 1, 89\u201395 (1975)","journal-title":"Comput. Math. Appl."},{"key":"437_CR7","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 algorithm for the fixed charge problem. Nav. Res. Logist. Q. 14, 101\u2013113 (1967)","journal-title":"Nav. Res. Logist. Q."},{"key":"437_CR8","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/nav.3800160311","volume":"16","author":"D.R. Drenzler","year":"1969","unstructured":"Drenzler, D.R.: An approximate method for the fixed charge problem. Nav. Res. Logist. Q. 16, 411\u2013416 (1969)","journal-title":"Nav. Res. Logist. Q."},{"key":"437_CR9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0377-2217(91)90084-9","volume":"52","author":"D.C. Wright","year":"1991","unstructured":"Wright, D.C., Lanzenauer, H.V.: COLE: A new heuristic approach for fixed charge problem computational results. Eur. J. Oper. Res. 52, 235\u2013246 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"437_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10479-008-0483-2","volume":"172","author":"J.S. Aguado","year":"2009","unstructured":"Aguado, J.S.: Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems. Ann. Oper. Res. 172, 45\u201369 (2009)","journal-title":"Ann. Oper. Res."},{"key":"437_CR11","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S0377-2217(97)00284-1","volume":"106","author":"M. Sun","year":"1998","unstructured":"Sun, M., Aronson, J.E., McKeown, P.G., Drinka, D.: A tabu search heuristic procedure for the fixed charge transportation problem. Eur. J. Oper. Res. 106, 441\u2013456 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"437_CR12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10732-005-2135-x","volume":"11","author":"F. Glover","year":"2005","unstructured":"Glover, F., Amini, M., Kochenberger, G.: Parametric ghost image processes for fixed charge problems: a study of transportation networks. J. Heuristics 11, 307\u2013336 (2005)","journal-title":"J. Heuristics"},{"key":"437_CR13","doi-asserted-by":"crossref","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, 2079\u20132092 (2008)","journal-title":"Comput. Oper. Res."},{"key":"437_CR14","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1016\/j.ejor.2007.12.005","volume":"194","author":"N. Jawahar","year":"2009","unstructured":"Jawahar, N., Balaji, A.N.: A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge. Eur. J. Oper. Res. 194, 496\u2013537 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"437_CR15","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.cie.2010.04.007","volume":"59","author":"M. Hajiaghaei-Keshteli","year":"2010","unstructured":"Hajiaghaei-Keshteli, M., Molla-Alizadeh-Zavardehi, S., Tavakkoli-Moghaddam, R.: Addressing a nonlinear fixed-charge transportation problem using a spanning tree-based genetic algorithm. Comput. Ind. Eng. 59, 259\u2013271 (2010)","journal-title":"Comput. Ind. Eng."},{"key":"437_CR16","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.cie.2007.06.022","volume":"53","author":"J.B. Jo","year":"2007","unstructured":"Jo, J.B., Li, Y., Gen, M.: Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm. Comput. Ind. Eng. 53, 290\u2013298 (2007)","journal-title":"Comput. Ind. Eng."},{"key":"437_CR17","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.omega.2008.02.001","volume":"37","author":"M. Caramia","year":"2009","unstructured":"Caramia, M., Guerriero, F.: A heuristic approach to long-haul freight transportation with multiple objective functions. OMEGA, Int. J. Manag. Sci. 37, 600\u2013614 (2009)","journal-title":"OMEGA, Int. J. Manag. Sci."},{"key":"437_CR18","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.10068","volume":"41","author":"F. Ortega","year":"2003","unstructured":"Ortega, F., Wolsey, L.A.: A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41, 143\u2013158 (2003)","journal-title":"Networks"},{"key":"437_CR19","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1287\/mnsc.22.5.587","volume":"22","author":"W.E. Walker","year":"1976","unstructured":"Walker, W.E.: A heuristic adjacent extreme point algorithm for the fixed charge problem. Manag. Sci. 22, 587\u2013596 (1976)","journal-title":"Manag. Sci."},{"key":"437_CR20","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.omega.2009.10.005","volume":"38","author":"V. Adlakha","year":"2010","unstructured":"Adlakha, V., Kowalski, K., Lev, B.: A branching method for the fixed charge transportation problem. OMEGA, Int. J. Manag. Sci. 38, 393\u2013397 (2010)","journal-title":"OMEGA, Int. J. Manag. Sci."},{"key":"437_CR21","doi-asserted-by":"crossref","first-page":"2306","DOI":"10.1016\/j.mcm.2011.05.039","volume":"54","author":"S. Schrenk","year":"2011","unstructured":"Schrenk, S., Finke, G., Cung, V.D.: Two classical transportation problems revisited: pure constant fixed charges and the paradox. Math. Comput. Model. 54, 2306\u20132315 (2011)","journal-title":"Math. Comput. Model."},{"key":"437_CR22","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/nav.3800150306","volume":"15","author":"W. Hirsch","year":"1968","unstructured":"Hirsch, W., Danzig, G.B.: The fixed charge problem. Nav. Res. Logist. Q. 15, 413\u2013424 (1968)","journal-title":"Nav. Res. Logist. Q."},{"key":"437_CR23","doi-asserted-by":"crossref","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, Int. J. Manag. Sci. 31, 205\u2013211 (2003)","journal-title":"OMEGA, Int. J. Manag. Sci."},{"key":"437_CR24","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1080\/00207390500137837","volume":"36","author":"K. Kowalski","year":"2005","unstructured":"Kowalski, K.: On the structure of the fixed charge transportation problem. Int. J. Math. Educ. Sci. Technol. 36, 879\u2013888 (2005)","journal-title":"Int. J. Math. Educ. Sci. Technol."},{"key":"437_CR25","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1002\/nav.3800080104","volume":"8","author":"M.L. Balinski","year":"1961","unstructured":"Balinski, M.L.: Fixed cost transportation problems. Nav. Res. Logist. Q. 8, 41\u201354 (1961)","journal-title":"Nav. Res. Logist. Q."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0437-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-013-0437-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0437-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T21:39:21Z","timestamp":1564522761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-013-0437-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,16]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["437"],"URL":"https:\/\/doi.org\/10.1007\/s10957-013-0437-y","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,16]]}}}