{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:57:14Z","timestamp":1768525034173,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T00:00:00Z","timestamp":1526601600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10898-018-0661-y","type":"journal-article","created":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T02:03:03Z","timestamp":1526608983000},"page":"517-538","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation"],"prefix":"10.1007","volume":"72","author":[{"given":"Yixin","family":"Zhao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2094-7376","authenticated-orcid":false,"given":"Torbj\u00f6rn","family":"Larsson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2081-2888","authenticated-orcid":false,"given":"Elina","family":"R\u00f6nnberg","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,18]]},"reference":[{"key":"661_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10479-008-0483-2","volume":"172","author":"JS 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."},{"issue":"6","key":"661_CR2","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10732-008-9078-y","volume":"15","author":"P Avella","year":"2008","unstructured":"Avella, P., Boccia, M., Sforza, A., Vasilev, I.: An effective heuristic for large-scale capacitated facility location problems. J. Heuristics 15(6), 597\u2013615 (2008)","journal-title":"J. Heuristics"},{"issue":"5","key":"661_CR3","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\u2013one knapsack problems. Oper. Res. 28(5), 1130\u20131154 (1980)","journal-title":"Oper. Res."},{"issue":"1","key":"661_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/nav.3800080104","volume":"8","author":"ML Balinski","year":"1961","unstructured":"Balinski, M.L.: Fixed-cost transportation problems. Nav. Res. Logist. Q. 8(1), 41\u201354 (1961)","journal-title":"Nav. Res. Logist. Q."},{"issue":"3","key":"661_CR5","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1287\/opre.29.3.448","volume":"29","author":"RS Barr","year":"1981","unstructured":"Barr, R.S., Glover, F., Klingman, D.: A new optimization method for large scale fixed charge transportation problems. Oper. Res. 29(3), 448\u2013463 (1981)","journal-title":"Oper. Res."},{"issue":"4","key":"661_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1002\/(SICI)1520-6750(199906)46:4<341::AID-NAV1>3.0.CO;2-A","volume":"46","author":"G Bell","year":"1999","unstructured":"Bell, G., Lamar, B., Wallace, C.: Capacity improvement, penalties, and the fixed charge transportation problem. Nav. Res. Logist. 46(4), 341\u2013355 (1999)","journal-title":"Nav. Res. Logist."},{"key":"661_CR7","unstructured":"Brenninger-G\u00f6the, M.: Two vehicle routing problems\u2014mathematical programming approaches, Link\u00f6ping studies in science and technology. Dissertations No. 200, Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden (1989)"},{"issue":"5","key":"661_CR8","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1287\/opre.2014.1288","volume":"62","author":"E Buson","year":"2014","unstructured":"Buson, E., Roberti, R., Toth, P.: A reduced-cost iterated local search heuristic for the fixed-charge transportation problem. Oper. Res. 62(5), 1095\u20131106 (2014)","journal-title":"Oper. Res."},{"issue":"5","key":"661_CR9","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A Caprara","year":"1999","unstructured":"Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res. 47(5), 730\u2013743 (1999)","journal-title":"Oper. Res."},{"issue":"2","key":"661_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01581106","volume":"81","author":"S Ceria","year":"1998","unstructured":"Ceria, S., Nobili, P., Sassano, A.: A Lagrangian-based heuristic for large-scale set covering problems. Math. Program. 81(2), 215\u2013228 (1998)","journal-title":"Math. Program."},{"issue":"1","key":"661_CR11","doi-asserted-by":"publisher","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. Logist. Q. 14(1), 101\u2013113 (1967)","journal-title":"Nav. Res. Logist. Q."},{"issue":"1\u20133","key":"661_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"O Merle du","year":"1999","unstructured":"du Merle, O., Villeneuve, D., Desrosiers, J., Hansen, P.: Stabilized column generation. Discret. Math. 194(1\u20133), 229\u2013237 (1999)","journal-title":"Discret. Math."},{"key":"661_CR13","volume-title":"Theory of Linear Optimization","author":"II Eremin","year":"2002","unstructured":"Eremin, I.I.: Theory of Linear Optimization. VSP, Utrecht (2002)"},{"issue":"4","key":"661_CR14","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1002\/nav.3800260408","volume":"26","author":"J Fisk","year":"1979","unstructured":"Fisk, J., McKeown, P.G.: The pure fixed charge transportation problem. Nav. Res. Logist. Q. 26(4), 631\u2013641 (1979)","journal-title":"Nav. Res. Logist. Q."},{"key":"661_CR15","volume-title":"AMPL: A Modeling Language for Mathematical Programming","author":"R Fourer","year":"2002","unstructured":"Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL: A Modeling Language for Mathematical Programming. Duxbury Press, Pacific Grove (2002)"},{"issue":"4","key":"661_CR16","doi-asserted-by":"publisher","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(4), 307\u2013336 (2005)","journal-title":"J. Heuristics"},{"issue":"6","key":"661_CR17","doi-asserted-by":"publisher","first-page":"1529","DOI":"10.1287\/opre.19.6.1529","volume":"19","author":"P Gray","year":"1971","unstructured":"Gray, P.: Exact solution of the fixed-charge transportation problem. Oper. Res. 19(6), 1529\u20131538 (1971)","journal-title":"Oper. Res."},{"issue":"2","key":"661_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02579036","volume":"11","author":"M Guignard","year":"2003","unstructured":"Guignard, M.: Lagrangean relaxation. TOP 11(2), 151\u2013228 (2003)","journal-title":"TOP"},{"issue":"2","key":"661_CR19","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M Guignard","year":"1987","unstructured":"Guignard, M., Kim, S.: Lagrangean decomposition: a model yielding stronger Lagrangean bounds. Math. Program. 39(2), 215\u2013228 (1987)","journal-title":"Math. Program."},{"issue":"3","key":"661_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0166-218X(92)00177-N","volume":"48","author":"M G\u00f6the-Lundgren","year":"1994","unstructured":"G\u00f6the-Lundgren, M., Larsson, T.: A set covering reformulation of the pure fixed charge transportation problem. Discret. Appl. Math. 48(3), 245\u2013249 (1994)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"661_CR21","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/nav.3800150306","volume":"15","author":"Warren M. Hirsch","year":"1968","unstructured":"Hirsch, W.M., Dantzig, G.B.: The fixed charge problem. RAND Corporation Rept RM-1383 (1954) (Published 1968 in Naval Research Logistics Quarterly 15(3):413\u2013424)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"661_CR22","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/BF01589330","volume":"20","author":"KL Hoffman","year":"1981","unstructured":"Hoffman, K.L.: A method for globally minimizing concave functions over convex sets. Math. Program. 20(1), 22\u201332 (1981)","journal-title":"Math. Program."},{"issue":"3","key":"661_CR23","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/S0377-2217(96)00082-3","volume":"101","author":"TH Hultberg","year":"1997","unstructured":"Hultberg, T.H., Cardoso, D.M.: The teacher assignment problem: a special case of the fixed charge transportation problem. Eur. J. Oper. Res. 101(3), 463\u2013473 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"661_CR24","unstructured":"IBM ILOG CPLEX Optimizer. \n                    http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/\n                    \n                   (2009). Accessed 20 Oct 2017"},{"issue":"3","key":"661_CR25","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0377-2217(86)90328-0","volume":"27","author":"K J\u00f6rnsten","year":"1986","unstructured":"J\u00f6rnsten, K., N\u00e4sberg, M.: A new Lagrangian relaxation approach to the generalized assignment problem. Eur. J. Oper. Res. 27(3), 313\u2013323 (1986)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"661_CR26","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1287\/mnsc.22.10.1116","volume":"22","author":"J Kennington","year":"1976","unstructured":"Kennington, J., Unger, E.: A new branch-and-bound algorithm for the fixed-charge transportation problem. Manag. Sci. 22(10), 1116\u20131126 (1976)","journal-title":"Manag. Sci."},{"issue":"4","key":"661_CR27","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","volume":"24","author":"D Kim","year":"1999","unstructured":"Kim, D., Pardalos, P.M.: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24(4), 195\u2013203 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"661_CR28","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10614-006-9028-4","volume":"27","author":"D Kim","year":"2006","unstructured":"Kim, D., Pan, X., Pardalos, M.P.: An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems. Comput. Econ. 27(2), 273\u2013293 (2006)","journal-title":"Comput. Econ."},{"issue":"5","key":"661_CR29","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D Klingman","year":"1974","unstructured":"Klingman, D., Napier, A., Stutz, J.: NETGEN: a program for generating large scale (un)capacitated assignment, transportation, and minimum cost flow network problems. Manag. Sci. 20(5), 814\u2013821 (1974)","journal-title":"Manag. Sci."},{"issue":"6","key":"661_CR30","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."},{"issue":"1","key":"661_CR31","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/0377-2217(94)90126-0","volume":"78","author":"T Larsson","year":"1994","unstructured":"Larsson, T., Migdalas, A., R\u00f6nnqvist, M.: A Lagrangian heuristic for the capacitated concave minimum cost network flow problem. Eur. J. Oper. Res. 78(1), 116\u2013129 (1994)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"661_CR32","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0191-2615(02)00092-9","volume":"38","author":"T Larsson","year":"2004","unstructured":"Larsson, T., Patriksson, M., Rydergren, C.: A column generation procedure for the side constrained traffic equilibrium problem. Transp. Res. Part B Methodol. 38(1), 17\u201338 (2004)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"1","key":"661_CR33","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10898-005-1383-5","volume":"35","author":"S Lawphongpanich","year":"2006","unstructured":"Lawphongpanich, S.: Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation. J. Glob. Optim. 35(1), 121\u2013130 (2006)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"661_CR34","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1504\/IJMOR.2012.046686","volume":"4","author":"L Letocart","year":"2012","unstructured":"Letocart, L., Nagih, A., Touati-Moungla, N.: Dantzig\u2013Wolfe and Lagrangian decompositions in integer linear programming. Int. J. Math. Oper. Res. 4(3), 247\u2013262 (2012)","journal-title":"Int. J. Math. Oper. Res."},{"key":"661_CR35","unstructured":"Li, X., Lin, G., Shen, C., Hengel, A.V.D., Dick, A.: Learning hash functions using column generation. In: Proceedings of the 30th International Conference on Machine Learning, Atlanta, Georgia, USA, vol. 28 (2013)"},{"issue":"6","key":"661_CR36","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M.E., Desrosiers, J.: Selected topics in column generation. Oper. Res. 53(6), 1007\u20131023 (2005)","journal-title":"Oper. Res."},{"issue":"3","key":"661_CR37","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0167-9236(98)00042-6","volume":"23","author":"V Maniezzo","year":"1998","unstructured":"Maniezzo, V., Mendes, I., Paruccini, M.: Decision support for siting problems. Decis. Support Syst. 23(3), 273\u2013284 (1998)","journal-title":"Decis. Support Syst."},{"issue":"3","key":"661_CR38","first-page":"292","volume":"7","author":"P Manimaran","year":"2011","unstructured":"Manimaran, P., Selladurai, V., Ranganathan, R., Sasikumar, G.: Genetic algorithm for optimisation of distribution system in a single stage supply chain network with fixed charges. Int. J. Ind. Syst. Eng. 7(3), 292\u2013316 (2011)","journal-title":"Int. J. Ind. Syst. Eng."},{"issue":"3","key":"661_CR39","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1287\/opre.23.3.389","volume":"23","author":"RE Marsten","year":"1975","unstructured":"Marsten, R.E., Hogan, W.W., Blankenship, J.W.: The boxstep method for large-scale optimization. Oper. Res. 23(3), 389\u2013405 (1975)","journal-title":"Oper. Res."},{"issue":"6","key":"661_CR40","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1287\/opre.23.6.1183","volume":"23","author":"PG McKeown","year":"1975","unstructured":"McKeown, P.G.: A vertex ranking procedure for the linear fixed charge problem. Oper. Res. 23(6), 1183\u20131191 (1975)","journal-title":"Oper. Res."},{"key":"661_CR41","unstructured":"Mingozzi, A., Roberti, R.: An exact algorithm for the fixed charge transportation problem based on matching source and sink patterns. Transp. Sci., articles in advance, published online April 27, 2017 (2017)"},{"issue":"2","key":"661_CR42","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1287\/opre.16.2.268","volume":"16","author":"KG Murty","year":"1968","unstructured":"Murty, K.G.: Solving the fixed charge problem by ranking the extreme points. Oper. Res. 16(2), 268\u2013279 (1968)","journal-title":"Oper. Res."},{"issue":"2","key":"661_CR43","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1080\/10556780902992837","volume":"25","author":"CMO Pimentel","year":"2010","unstructured":"Pimentel, C.M.O., Alvelos, F.P., de Carvalho, J.M.V.: Comparing Dantzig\u2013Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem. Optim. Methods Softw. 25(2), 299\u2013319 (2010)","journal-title":"Optim. Methods Softw."},{"issue":"6","key":"661_CR44","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1287\/mnsc.2014.1947","volume":"61","author":"R Roberti","year":"2015","unstructured":"Roberti, R., Bartolini, E., Mingozzi, A.: The fixed charge transportation problem: an exact algorithm based on a new integer programming formulation. Manag. Sci. 61(6), 1275\u20131291 (2015)","journal-title":"Manag. Sci."},{"issue":"6","key":"661_CR45","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1287\/opre.15.6.1157","volume":"15","author":"JW Stroup","year":"1967","unstructured":"Stroup, J.W.: Allocation of launch vehicles to space missions: a fixed-cost transportation problem. Oper. Res. 15(6), 1157\u20131163 (1967)","journal-title":"Oper. Res."},{"issue":"2\u20133","key":"661_CR46","doi-asserted-by":"publisher","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(2\u20133), 441\u2013456 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"661_CR47","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1013141227104","volume":"2","author":"WE Wilhelm","year":"1995","unstructured":"Wilhelm, W.E.: A technical review of column generation in integer programming. Optim. Eng. 2(2), 159\u2013200 (1995)","journal-title":"Optim. Eng."},{"issue":"3","key":"661_CR48","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0377-2217(89)90441-4","volume":"42","author":"DD Wright","year":"1989","unstructured":"Wright, D.D., von Lanzenauer, C.H.: Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics. Eur. J. Oper. Res. 42(3), 305\u2013312 (1989)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"661_CR49","doi-asserted-by":"publisher","first-page":"2668","DOI":"10.1016\/j.apm.2006.10.011","volume":"31","author":"L Yang","year":"2007","unstructured":"Yang, L., Feng, Y.: A bicriteria solid transportation problem with fixed charge under stochastic environment. Appl. Math. Model. 31(12), 2668\u20132683 (2007)","journal-title":"Appl. Math. Model."},{"issue":"3","key":"661_CR50","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/j.asoc.2005.11.011","volume":"7","author":"L Yang","year":"2007","unstructured":"Yang, L., Liu, L.: Fuzzy fixed charge solid transportation problem and algorithm. Appl. Soft Comput. 7(3), 879\u2013889 (2007)","journal-title":"Appl. Soft Comput."},{"key":"661_CR51","unstructured":"Zhao, Y.: On the integration of heuristics with column-oriented models for discrete optimization, Link\u00f6ping studies in science and technology. Dissertations No. 1764, Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden (2016)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0661-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0661-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0661-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T21:32:02Z","timestamp":1558128722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0661-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,18]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["661"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0661-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,18]]},"assertion":[{"value":"21 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}