{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T15:47:31Z","timestamp":1759160851578,"version":"3.37.3"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T00:00:00Z","timestamp":1541635200000},"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":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10100-018-0593-0","type":"journal-article","created":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T05:09:44Z","timestamp":1541653784000},"page":"105-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Lagrangian relaxation of the generic materials and operations planning model"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3734-9620","authenticated-orcid":false,"given":"G.","family":"Rius-Sorolla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5796-9053","authenticated-orcid":false,"given":"J.","family":"Maheut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4360-6128","authenticated-orcid":false,"given":"Jairo R.","family":"Coronado-Hernandez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. P.","family":"Garcia-Sabater","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,8]]},"reference":[{"issue":"3","key":"593_CR1","doi-asserted-by":"publisher","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S Agmon","year":"1954","unstructured":"Agmon S (1954) The relaxation method for linear inequalities. Can J Math 6(3):382\u2013392","journal-title":"Can J Math"},{"issue":"1","key":"593_CR2","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.riai.2014.11.005","volume":"12","author":"JA Ara\u00fazo","year":"2015","unstructured":"Ara\u00fazo JA, Del-Olmo-Mart\u00ednez R, Lavi\u00f3s JJ, De-Benito-Mart\u00edn JJ (2015) Programaci\u00f3n y Control de Sistemas de Fabricaci\u00f3n Flexibles: un Enfoque Hol\u00f3nico. Rev Iberoam Autom Inf Ind RIAI 12(1):58\u201368. \nhttps:\/\/doi.org\/10.1016\/j.riai.2014.11.005","journal-title":"Rev Iberoam Autom Inf Ind RIAI"},{"issue":"9","key":"593_CR3","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.parco.2006.03.002","volume":"32","author":"A Attanasio","year":"2006","unstructured":"Attanasio A, Ghiani G, Grandinetti L, Guerriero F (2006) Auction algorithms for decentralized parallel machine scheduling. Parallel Comput 32(9):701\u2013709. \nhttps:\/\/doi.org\/10.1016\/j.parco.2006.03.002","journal-title":"Parallel Comput"},{"issue":"3","key":"593_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F Barahona","year":"2000","unstructured":"Barahona F, Anbil R (2000) The volume algorithm: producing primal solutions with a subgradient method. Math Program 87(3):385\u2013399. \nhttps:\/\/doi.org\/10.1007\/s101070050002","journal-title":"Math Program"},{"issue":"2","key":"593_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.2307\/2371728","volume":"67","author":"CB Barker","year":"1945","unstructured":"Barker CB (1945) The Lagrange multiplier rule for two dependent and two independent variables. Am J Math 67(2):256. \nhttps:\/\/doi.org\/10.2307\/2371728","journal-title":"Am J Math"},{"issue":"2","key":"593_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1013601906224","volume":"112","author":"C Beltran","year":"2002","unstructured":"Beltran C, Heredia FJ (2002) Unit commitment by augmented lagrangian relaxation: testing two decomposition approaches. J Optim Theory Appl 112(2):295\u2013314. \nhttps:\/\/doi.org\/10.1023\/A:1013601906224","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"593_CR7","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4(1):238\u2013252. \nhttps:\/\/doi.org\/10.1007\/BF01386316","journal-title":"Numer Math"},{"key":"593_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0120696","volume-title":"Nondifferentiable Optimization","author":"Dimitri P. Bertsekas","year":"1975","unstructured":"Bertsekas DP (1975) Nondifferentiable optimization via approximation. In: Mathematical programming study, vol 3, pp 1\u201325. \nhttps:\/\/doi.org\/10.1007\/BFb0120696"},{"issue":"2","key":"593_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF00937167","volume":"29","author":"DP Bertsekas","year":"1979","unstructured":"Bertsekas DP (1979) Convexification procedures and decomposition methods for nonconvex optimization problems. J Optim Theory Appl 29(2):169\u2013197. \nhttps:\/\/doi.org\/10.1007\/BF00937167","journal-title":"J Optim Theory Appl"},{"key":"593_CR10","unstructured":"Bilde O, Krarup J (1967) Bestemmelse af optimal beliggenhed af produktionssteder. Research reportIMSOR, The Technical University of Denmark, pp 79\u201388"},{"issue":"10","key":"593_CR11","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1287\/mnsc.28.10.1174","volume":"28","author":"GR Bitran","year":"1982","unstructured":"Bitran GR, Yanasse HH (1982) Computational complexity of the capacitated lot size problem. Manag Sci 28(10):1174\u20131186. \nhttps:\/\/doi.org\/10.1287\/mnsc.28.10.1174","journal-title":"Manag Sci"},{"key":"593_CR12","unstructured":"Blouin VY, Lassiter JB, Wiecek MM, Fadel GM (2005) Augmented Lagrangian coordination for decomposed design problems. In: 6th World Congress on structural and multidisciplinary optimization, (June), 1\u201310"},{"key":"593_CR13","unstructured":"Boyd S, Mutapcic A, Xiao L, Mutapcic A (2008) Subgradient methods. Lecture notes of EE392o, Stanford \u2026, 1, 1\u201321"},{"issue":"August 1974","key":"593_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0120697","volume":"3","author":"PM Camerini","year":"1975","unstructured":"Camerini PM, Fratta L, Maffioli F (1975) On improving relaxation methods by modified gradient techniques. Nondiffer Optim 3(August 1974):26\u201334. \nhttps:\/\/doi.org\/10.1007\/BFb0120697","journal-title":"Nondiffer Optim"},{"issue":"3","key":"593_CR15","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s10957-007-9349-z","volume":"137","author":"TS Chang","year":"2008","unstructured":"Chang TS (2008) Comments on \u00absurrogate gradient algorithm for Lagrangian relaxation\u00bb. J Optim Theory Appl 137(3):691\u2013697. \nhttps:\/\/doi.org\/10.1007\/s10957-007-9349-z","journal-title":"J Optim Theory Appl"},{"key":"593_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27686-6","volume-title":"Decomposition techniques in mathematical programming","author":"AJ Conejo","year":"2006","unstructured":"Conejo AJ, Castillo E, Minguez R, Garcia-Bertrand R (2006) Decomposition techniques in mathematical programming. Springer, Berlin. \nhttps:\/\/doi.org\/10.1007\/3-540-27686-6"},{"key":"593_CR17","doi-asserted-by":"publisher","unstructured":"Coronado-Hern\u00e1ndez JR (2016) An\u00e1lisis del efecto de algunos factores de complejidad e incertidumbre en el rendimiento de las Cadenas de Suministro. Propuesta de una herramienta de valoraci\u00f3n basada en simulaci\u00f3n. Universitat Polit\u00e8cnica de Val\u00e8ncia, Valencia (Spain). \nhttps:\/\/doi.org\/10.4995\/Thesis\/10251\/61467","DOI":"10.4995\/Thesis\/10251\/61467"},{"issue":"2","key":"593_CR18","doi-asserted-by":"publisher","first-page":"1366","DOI":"10.4995\/wpom.v1i2.785","volume":"1","author":"JR Coronado-Hern\u00e1ndez","year":"2010","unstructured":"Coronado-Hern\u00e1ndez JR, Garcia-Sabater JP, Maheut J, Garcia-Sabater J (2010) Modelo de optimizaci\u00f3n estoc\u00e1stica para la planificaci\u00f3n de cadenas de suministro para productos con ciclo de vida cortos. WPOM Work Pap Oper Manag 1(2):1366\u20131375. \nhttps:\/\/doi.org\/10.4995\/wpom.v1i2.785","journal-title":"WPOM Work Pap Oper Manag"},{"issue":"3","key":"593_CR19","doi-asserted-by":"publisher","first-page":"628","DOI":"10.3923\/jeasci.2017.628.635","volume":"12","author":"JR Coronado-Hern\u00e1ndez","year":"2017","unstructured":"Coronado-Hern\u00e1ndez JR, Simancas-Mateus D, Avila-Martinez K, Garcia-Sabater JP (2017) Heuristic for material and operations planning in supply chains with alternative product structurture. J Eng Appl Sci 12(3):628\u2013635. \nhttps:\/\/doi.org\/10.3923\/jeasci.2017.628.635","journal-title":"J Eng Appl Sci"},{"issue":"1","key":"593_CR20","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper Res 8(1):101\u2013111. \nhttps:\/\/doi.org\/10.1287\/opre.8.1.101","journal-title":"Oper Res"},{"key":"593_CR21","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.cor.2014.03.006","volume":"61","author":"A Diabat","year":"2015","unstructured":"Diabat A, Batta\u00efa O, Nazzal D (2015) An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem. Comput Oper Res 61:170\u2013178. \nhttps:\/\/doi.org\/10.1016\/j.cor.2014.03.006","journal-title":"Comput Oper Res"},{"key":"593_CR22","doi-asserted-by":"publisher","first-page":"2121","DOI":"10.1109\/CDC.2012.6426698","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi J, Hazan E, Singer Y (2011) Adaptive subgradient methods for online learning and stochastic optimization. J Mach Learn Res 12:2121\u20132159. \nhttps:\/\/doi.org\/10.1109\/CDC.2012.6426698","journal-title":"J Mach Learn Res"},{"key":"593_CR23","doi-asserted-by":"publisher","DOI":"10.1287\/inte.15.2.10","author":"ML Fisher","year":"1985","unstructured":"Fisher ML (1985) An application oriented guide to Lagrangean relaxation. Interfaces. \nhttps:\/\/doi.org\/10.1287\/inte.15.2.10","journal-title":"Interfaces"},{"issue":"12 Supplement","key":"593_CR24","doi-asserted-by":"publisher","first-page":"1861","DOI":"10.1287\/mnsc.1040.0263","volume":"50","author":"ML Fisher","year":"2004","unstructured":"Fisher ML (2004) The Lagrangian relaxation method for solving integer programming problems. Manag Sci 50(12 Supplement):1861\u20131871. \nhttps:\/\/doi.org\/10.1287\/mnsc.1040.0263","journal-title":"Manag Sci"},{"issue":"1","key":"593_CR25","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0166-218X(83)90016-1","volume":"5","author":"ML Fisher","year":"1983","unstructured":"Fisher ML, Lageweg BJ, Lenstra JK, Kan AHGR (1983) Surrogate duality relaxation for job shop scheduling. Discrete Appl Math 5(1):65\u201375. \nhttps:\/\/doi.org\/10.1016\/0166-218X(83)90016-1","journal-title":"Discrete Appl Math"},{"issue":"3\u20134","key":"593_CR26","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1016\/j.apm.2014.07.006","volume":"39","author":"YM Fu","year":"2015","unstructured":"Fu YM, Diabat A (2015) A lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Appl Math Model 39(3\u20134):1194\u20131201. \nhttps:\/\/doi.org\/10.1016\/j.apm.2014.07.006","journal-title":"Appl Math Model"},{"key":"593_CR27","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-1-4419-7572-0_17","volume-title":"International Series in Operations Research & Management Science","author":"Roberto D. Galv\u00e3o","year":"2011","unstructured":"Galv\u00e3o RD, Marianov V (2011) Lagrangean relaxation-based techniques for solving facility location problems. In: Foundations of location analysis, pp 391\u2013420. \nhttps:\/\/doi.org\/10.1007\/978-1-4419-7572-0_17"},{"issue":"2","key":"593_CR28","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1504\/EJIE.2013.052572","volume":"7","author":"JP Garcia-Sabater","year":"2013","unstructured":"Garcia-Sabater JP, Maheut J, Marin-Garcia JA (2013) A new formulation technique to model materials and operations planning: the generic materials and operations planning (GMOP) problem. Eur J Ind Eng 7(2):119. \nhttps:\/\/doi.org\/10.1504\/EJIE.2013.052572","journal-title":"Eur J Ind Eng"},{"issue":"1","key":"593_CR29","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10589-007-9149-2","volume":"44","author":"M Gaudioso","year":"2009","unstructured":"Gaudioso M, Giallombardo G, Miglionico G (2009) On solving the Lagrangian dual of integer programs via an incremental approach. Comput Optim Appl 44(1):117\u2013138. \nhttps:\/\/doi.org\/10.1007\/s10589-007-9149-2","journal-title":"Comput Optim Appl"},{"issue":"December","key":"593_CR30","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion AM (1974) Lagrangean relaxation for integer programming. Approaches Integer Program 2(December):82\u2013114. \nhttps:\/\/doi.org\/10.1007\/BFb0120690","journal-title":"Approaches Integer Program"},{"issue":"3","key":"593_CR31","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/j.automatica.2013.01.009","volume":"49","author":"P Giselsson","year":"2013","unstructured":"Giselsson P, Doan MD, Keviczky T, Schutter B De, Rantzer A (2013) Accelerated gradient methods and dual decomposition in distributed model predictive control. Automatica 49(3):829\u2013833. \nhttps:\/\/doi.org\/10.1016\/j.automatica.2013.01.009","journal-title":"Automatica"},{"issue":"1","key":"593_CR32","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF01584346","volume":"13","author":"J Goffin","year":"1977","unstructured":"Goffin J (1977) On convergence rates of subgradient optimization methods. Math Program 13(1):329\u2013347. \nhttps:\/\/doi.org\/10.1007\/BF01584346","journal-title":"Math Program"},{"issue":"9","key":"593_CR33","first-page":"817","volume":"52","author":"S Gould","year":"1945","unstructured":"Gould S (1945) Lagrange multipliers and functional derterminants. Bull Am Math Soc 52(9):817","journal-title":"Bull Am Math Soc"},{"issue":"2","key":"593_CR34","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02579036","volume":"11","author":"M Guignard","year":"2003","unstructured":"Guignard M (2003) Lagrangean relaxation. Soc Estad Investig Oper Top 11(2):151\u2013200. \nhttps:\/\/doi.org\/10.1007\/BF02579036","journal-title":"Soc Estad Investig Oper Top"},{"issue":"2","key":"593_CR35","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M Guignard","year":"1987","unstructured":"Guignard M, Kim S (1987) Lagrangean decomposition: a model yielding stronger Lagrangean bounds. Math Program 39(2):215\u2013228. \nhttps:\/\/doi.org\/10.1007\/BF02592954","journal-title":"Math Program"},{"issue":"11","key":"593_CR36","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1016\/j.compchemeng.2009.10.019","volume":"34","author":"V Gunnerud","year":"2010","unstructured":"Gunnerud V, Foss B (2010) Oil production optimization\u2014a piecewise linear model, solved with two decomposition strategies. Comput Chem Eng 34(11):1803\u20131812. \nhttps:\/\/doi.org\/10.1016\/j.compchemeng.2009.10.019","journal-title":"Comput Chem Eng"},{"issue":"5","key":"593_CR37","doi-asserted-by":"publisher","first-page":"1937","DOI":"10.1021\/ie980782t","volume":"38","author":"A Gupta","year":"1999","unstructured":"Gupta A, Maranas CD (1999) A hierarchical Lagrangean relaxation procedure for solving midterm planning problems. Ind Eng Chem Res 38(5):1937\u20131947. \nhttps:\/\/doi.org\/10.1021\/ie980782t","journal-title":"Ind Eng Chem Res"},{"key":"593_CR38","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.buildenv.2014.12.015","volume":"86","author":"H Harb","year":"2015","unstructured":"Harb H, Paprott J-N, Matthes P, Sch\u00fctz T, Streblow R, Mueller D (2015) Decentralized scheduling strategy of heating systems for balancing the residual load. Build Environ 86:132\u2013140. \nhttps:\/\/doi.org\/10.1016\/j.buildenv.2014.12.015","journal-title":"Build Environ"},{"issue":"6","key":"593_CR39","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held M, Karp RM (1970) The traveling-salesman problem and minimum spanning trees. Oper Res 18(6):1138\u20131162. \nhttps:\/\/doi.org\/10.1287\/opre.18.6.1138","journal-title":"Oper Res"},{"issue":"1","key":"593_CR40","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held M, Karp RM (1971) The traveling-salesman problem and minimum spanning trees: part II. Math Program 1(1):6\u201325. \nhttps:\/\/doi.org\/10.1007\/BF01584070","journal-title":"Math Program"},{"issue":"1","key":"593_CR41","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M Held","year":"1974","unstructured":"Held M, Wolfe P, Crowder HP (1974) Validation of subgradient optimization. Math Program 6(1):62\u201388. \nhttps:\/\/doi.org\/10.1007\/BF01580223","journal-title":"Math Program"},{"issue":"3","key":"593_CR42","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1016\/j.ejor.2006.09.060","volume":"182","author":"V Jeet","year":"2007","unstructured":"Jeet V, Kutanoglu E (2007) Lagrangian relaxation guided problem space search heuristics for generalized assignment problems. Eur J Oper Res 182(3):1039\u20131056. \nhttps:\/\/doi.org\/10.1016\/j.ejor.2006.09.060","journal-title":"Eur J Oper Res"},{"issue":"24","key":"593_CR43","doi-asserted-by":"publisher","first-page":"6783","DOI":"10.1080\/00207540701824217","volume":"47","author":"I-J Jeong","year":"2009","unstructured":"Jeong I-J, Yim S-B (2009) A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time. Int J Prod Res 47(24):6783\u20136805. \nhttps:\/\/doi.org\/10.1080\/00207540701824217","journal-title":"Int J Prod Res"},{"issue":"2","key":"593_CR44","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10898-007-9203-8","volume":"41","author":"R Karuppiah","year":"2008","unstructured":"Karuppiah R, Grossmann IE (2008) A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures. J Global Optim 41(2):163\u2013186. \nhttps:\/\/doi.org\/10.1007\/s10898-007-9203-8","journal-title":"J Global Optim"},{"issue":"11","key":"593_CR45","doi-asserted-by":"publisher","first-page":"2684","DOI":"10.1016\/j.compchemeng.2007.08.007","volume":"32","author":"JD Kelly","year":"2008","unstructured":"Kelly JD, Zyngier D (2008) Hierarchical decomposition heuristic for scheduling: coordinated reasoning for decentralized and distributed decision-making problems. Comput Chem Eng 32(11):2684\u20132705. \nhttps:\/\/doi.org\/10.1016\/j.compchemeng.2007.08.007","journal-title":"Comput Chem Eng"},{"issue":"5","key":"593_CR46","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1111\/itor.12089","volume":"21","author":"J Kong","year":"2014","unstructured":"Kong J, R\u00f6nnqvist M (2014) Coordination between strategic forest management and tactical logistic and production planning in the forestry supply chain. Int Trans Oper Res 21(5):703\u2013735. \nhttps:\/\/doi.org\/10.1111\/itor.12089","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"593_CR47","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1008373329033","volume":"18","author":"T Kuno","year":"2000","unstructured":"Kuno T, Utsunomiya T (2000) A Lagrangian based branch-and-bound algorithm for production-transportation problems. J Global Optim 18(1):59\u201373. \nhttps:\/\/doi.org\/10.1023\/A:1008373329033","journal-title":"J Global Optim"},{"issue":"4","key":"593_CR48","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1109\/TASE.2011.2160536","volume":"8","author":"HC Lau","year":"2011","unstructured":"Lau HC, Zhao ZJ, Ge SS, Lee TH (2011) Allocating resources in multiagent flowshops with adaptive auctions. IEEE Trans Autom Sci Eng 8(4):732\u2013743. \nhttps:\/\/doi.org\/10.1109\/TASE.2011.2160536","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"593_CR49","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-45586-8_4","volume":"2241","author":"C Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal C (2001) Lagrangian relaxation. Comput Comb Optim 2241:112\u2013156. \nhttps:\/\/doi.org\/10.1007\/3-540-45586-8_4","journal-title":"Comput Comb Optim"},{"issue":"3","key":"593_CR50","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1002\/aic.12614","volume":"58","author":"Z Li","year":"2012","unstructured":"Li Z, Ierapetritou MG (2012) Capacity expansion planning through augmented Lagrangian optimization and scenario decomposition. AIChE J 58(3):871\u2013883. \nhttps:\/\/doi.org\/10.1002\/aic.12614","journal-title":"AIChE J"},{"issue":"9\u201310","key":"593_CR51","doi-asserted-by":"publisher","first-page":"2428","DOI":"10.1016\/j.mcm.2011.05.054","volume":"54","author":"H Lidestam","year":"2011","unstructured":"Lidestam H, R\u00f6nnqvist M (2011) Use of Lagrangian decomposition in supply chain planning. Math Comput Model 54(9\u201310):2428\u20132442. \nhttps:\/\/doi.org\/10.1016\/j.mcm.2011.05.054","journal-title":"Math Comput Model"},{"issue":"4","key":"593_CR52","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1086\/294081","volume":"28","author":"JH Lorie","year":"1955","unstructured":"Lorie JH, Savage LJ (1955) Three problems in rationing capital. J Bus 28(4):229\u2013239. \nhttps:\/\/doi.org\/10.1086\/294081","journal-title":"J Bus"},{"issue":"1","key":"593_CR53","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jengtecman.2011.09.008","volume":"29","author":"SYP Lu","year":"2012","unstructured":"Lu SYP, Lau HYK, Yiu CKF (2012) A hybrid solution to collaborative decision-making in a decentralized supply-chain. J Eng Tech Manag 29(1):95\u2013111. \nhttps:\/\/doi.org\/10.1016\/j.jengtecman.2011.09.008","journal-title":"J Eng Tech Manag"},{"key":"593_CR54","doi-asserted-by":"publisher","unstructured":"Maheut J (2013) Modelos y Algoritmos Basados en el Concepto Stroke para la Planificaci\u00f3n y Programaci\u00f3n de Operaciones con Alternativas en Redes de Suministro. Universitat Polit\u00e8cnica de Val\u00e8ncia, Valencia (Spain). \nhttps:\/\/doi.org\/10.4995\/Thesis\/10251\/29290","DOI":"10.4995\/Thesis\/10251\/29290"},{"key":"593_CR55","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-33980-6_8","volume":"384 AICT","author":"J Maheut","year":"2012","unstructured":"Maheut J, Garcia-Sabater JP, Mula J (2012) The generic materials and operations planning (GMOP) problem solved iteratively: a case study in multi-site context. IFIP Adv Inf Commun Technol 384 AICT:66\u201373. \nhttps:\/\/doi.org\/10.1007\/978-3-642-33980-6_8","journal-title":"IFIP Adv Inf Commun Technol"},{"issue":"1","key":"593_CR56","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.ejor.2013.11.010","volume":"236","author":"K Mao","year":"2014","unstructured":"Mao K, Pan QK, Pang X, Chai T (2014) A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process. Eur J Oper Res 236(1):51\u201360. \nhttps:\/\/doi.org\/10.1016\/j.ejor.2013.11.010","journal-title":"Eur J Oper Res"},{"issue":"7","key":"593_CR57","doi-asserted-by":"publisher","first-page":"2691","DOI":"10.1021\/ie960901+","volume":"36","author":"CM Mcdonald","year":"1997","unstructured":"Mcdonald CM, Karimi IA (1997) Planning and scheduling of parallel semicontinuous processes. 1. Production planning. Ind Eng Chem Res 36(7):2691\u20132700. \nhttps:\/\/doi.org\/10.1021\/ie960901+","journal-title":"Ind Eng Chem Res"},{"issue":"1","key":"593_CR58","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0377-2217(98)00038-1","volume":"114","author":"MG Narciso","year":"1999","unstructured":"Narciso MG, Lorena LAN (1999) Lagrangean\/surrogate relaxation for generalized assignment problems. Eur J Oper Res 114(1):165\u2013177. \nhttps:\/\/doi.org\/10.1016\/S0377-2217(98)00038-1","journal-title":"Eur J Oper Res"},{"key":"593_CR59","first-page":"223","volume-title":"Applied Optimization","author":"Angelia Nedi\u0107","year":"2001","unstructured":"Nedic A, Bertsekas DP (2001) Convergence rate of incremental subgradient algorithms. In: Uryasev S, Pardalos PM (eds) Stochastic optimization: algorithms and applications, pp 223\u2013264"},{"issue":"1","key":"593_CR60","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cor.2009.04.008","volume":"37","author":"T Nishi","year":"2010","unstructured":"Nishi T, Hiranaka Y, Inuiguchi M (2010) Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness. Comput Oper Res 37(1):189\u2013198. \nhttps:\/\/doi.org\/10.1016\/j.cor.2009.04.008","journal-title":"Comput Oper Res"},{"issue":"3","key":"593_CR61","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak BT (1969) Minimization of unsmooth functionals. USSR Comput Math Math Phys 9(3):14\u201329. \nhttps:\/\/doi.org\/10.1016\/0041-5553(69)90061-5","journal-title":"USSR Comput Math Math Phys"},{"issue":"1","key":"593_CR62","first-page":"13","volume":"55","author":"T Pukkala","year":"2009","unstructured":"Pukkala T, Heinonen T, Kurttila M (2009) An application of a reduced cost approach to spatial forest planning. For Sci 55(1):13\u201322","journal-title":"For Sci"},{"issue":"SI","key":"593_CR63","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cie.2014.12.026","volume":"84","author":"T Qu","year":"2015","unstructured":"Qu T, Nie DX, Chen X, Chen XD, Dai QY, Huang GQ (2015) Optimal configuration of cluster supply chains with augmented Lagrange coordination. Comput Ind Eng 84(SI):43\u201355. \nhttps:\/\/doi.org\/10.1016\/j.cie.2014.12.026","journal-title":"Comput Ind Eng"},{"key":"593_CR64","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1016\/j.cie.2017.06.001","volume":"110","author":"MA Quddus","year":"2017","unstructured":"Quddus MA, Ibne Hossain NU, Mohammad M, Jaradat RM, Roni MS (2017) Sustainable network design for multi-purpose pellet processing depots under biomass supply uncertainty. Comput Ind Eng 110:462\u2013483. \nhttps:\/\/doi.org\/10.1016\/j.cie.2017.06.001","journal-title":"Comput Ind Eng"},{"issue":"3","key":"593_CR65","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/S0377-2217(99)00056-9","volume":"121","author":"J S\u00e1ez","year":"2000","unstructured":"S\u00e1ez J (2000) Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes. Eur J Oper Res 121(3):609\u2013626. \nhttps:\/\/doi.org\/10.1016\/S0377-2217(99)00056-9","journal-title":"Eur J Oper Res"},{"issue":"3","key":"593_CR66","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0167-6377(96)00019-3","volume":"19","author":"HD Sherali","year":"1996","unstructured":"Sherali HD, Choi G (1996) Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs. Oper Res Lett 19(3):105\u2013113. \nhttps:\/\/doi.org\/10.1016\/0167-6377(96)00019-3","journal-title":"Oper Res Lett"},{"issue":"8","key":"593_CR67","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1016\/j.jprocont.2014.05.013","volume":"24","author":"LE Sokoler","year":"2014","unstructured":"Sokoler LE, Standardi L, Edlund K, Poulsen NK, Madsen H, J\u00f8rgensen JB (2014) A Dantzig\u2013Wolfe decomposition algorithm for linear economic model predictive control of dynamically decoupled subsystems. J Process Control 24(8):1225\u20131236. \nhttps:\/\/doi.org\/10.1016\/j.jprocont.2014.05.013","journal-title":"J Process Control"},{"key":"593_CR68","volume-title":"Supply chain management and advanced planning. Concepts, models, software, and case studies","author":"H Stadtler","year":"2008","unstructured":"Stadtler H, Kilger C (2008) Supply chain management and advanced planning. In: Stadtler H, Kilger C (eds) Supply chain management and advanced planning. Concepts, models, software, and case studies. Springer, Berlin"},{"issue":"3","key":"593_CR69","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/s00158-005-0579-0","volume":"31","author":"S Tosserams","year":"2006","unstructured":"Tosserams S, Etman LFP, Papalambros PY, Rooda JE (2006) An augmented Lagrangian relaxation for analytical target cascading using the alternating direction method of multipliers. Struct Multidiscip Optim 31(3):176\u2013189. \nhttps:\/\/doi.org\/10.1007\/s00158-005-0579-0","journal-title":"Struct Multidiscip Optim"},{"issue":"2","key":"593_CR70","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ejor.2011.12.020","volume":"219","author":"PI Vidal-Carreras","year":"2012","unstructured":"Vidal-Carreras PI, Garcia-Sabater JP, Coronado-Hernandez JR (2012) Economic lot scheduling with deliberated and controlled coproduction. Eur J Oper Res 219(2):396\u2013404. \nhttps:\/\/doi.org\/10.1016\/j.ejor.2011.12.020","journal-title":"Eur J Oper Res"},{"issue":"2","key":"593_CR71","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.ijpe.2006.12.069","volume":"111","author":"G Walther","year":"2008","unstructured":"Walther G, Schmid E, Spengler TS (2008) Negotiation-based coordination in product recovery networks. Int J Prod Econ 111(2):334\u2013350. \nhttps:\/\/doi.org\/10.1016\/j.ijpe.2006.12.069","journal-title":"Int J Prod Econ"},{"issue":"1","key":"593_CR72","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/BF01585533","volume":"7","author":"P Wolfe","year":"1974","unstructured":"Wolfe P (1974) Note on a method of conjugate subgradients for minimizing nondifferentiable functions. Math Program 7(1):380\u2013383. \nhttps:\/\/doi.org\/10.1007\/BF01585533","journal-title":"Math Program"},{"issue":"1","key":"593_CR73","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.ijpe.2012.01.018","volume":"140","author":"ZH Zhang","year":"2012","unstructured":"Zhang ZH, Jiang H, Pan X (2012) A Lagrangian relaxation based approach for the capacitated lot sizing problem in closed-loop supply chain. Int J Prod Econ 140(1):249\u2013255. \nhttps:\/\/doi.org\/10.1016\/j.ijpe.2012.01.018","journal-title":"Int J Prod Econ"},{"issue":"3","key":"593_CR74","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1023\/A:1022646725208","volume":"100","author":"X Zhao","year":"1999","unstructured":"Zhao X, Luh PB, Wang J (1999) Surrogate gradient algorithm for Lagrangian relaxation method. J Optim Theory Appl 100(3):699\u2013712. \nhttps:\/\/doi.org\/10.1023\/A:1022646725208","journal-title":"J Optim Theory Appl"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0593-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-018-0593-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0593-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T05:21:41Z","timestamp":1578547301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-018-0593-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,8]]},"references-count":74,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["593"],"URL":"https:\/\/doi.org\/10.1007\/s10100-018-0593-0","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2018,11,8]]},"assertion":[{"value":"8 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}