{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:00:20Z","timestamp":1740182420283,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T00:00:00Z","timestamp":1635379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T00:00:00Z","timestamp":1635379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s43069-021-00094-9","type":"journal-article","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:02:48Z","timestamp":1637240568000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Feasibility-Ensured Lagrangian Heuristic for General Decomposable Problems"],"prefix":"10.1007","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7742-9097","authenticated-orcid":false,"given":"Kouhei","family":"Harada","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,28]]},"reference":[{"issue":"3","key":"94_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1287\/moor.1.3.225","volume":"1","author":"Jean-Pierre Aubin","year":"1976","unstructured":"Aubin J-P Ekeland I (1976) Estimates of the duality gap in nonconvex optimization. Math Operation Res 1(3):225\u2013245","journal-title":"Mathematics of Operations Research"},{"key":"94_CR2","doi-asserted-by":"crossref","unstructured":"Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: Column generation for solving huge integer programs. Operation Res 46(3):316\u2013329","DOI":"10.1287\/opre.46.3.316"},{"key":"94_CR3","doi-asserted-by":"crossref","unstructured":"Beasley JE (1993) Lagrangean heuristics for location problems. Euro J Operation Res 65(3):383\u2013399","DOI":"10.1016\/0377-2217(93)90118-7"},{"key":"94_CR4","unstructured":"Bertsekas DP (1982) Constrained optimization and Lagrange multiplier methods. Academic Press"},{"key":"94_CR5","unstructured":"Bertsekas DP (1999) Nonlinear Programming. Athena Scientific Belmont"},{"key":"94_CR6","unstructured":"Bertsekas DP (2009) Convex optimization theory. Athena Scientific Belmont"},{"key":"94_CR7","unstructured":"Bertsekas DP (2015) Convex optimization algorithms. Athena Scientific Belmont"},{"key":"94_CR8","volume-title":"Jean Charles Gilbert, Claude Lemar\u00e9chal, and Claudia Sagastiz\u00e1bal","author":"Joseph-Fr\u00e9d\u00e9ric Bonnans","year":"2006","unstructured":"Bonnans J-F, Gilbert JC, Lemar\u00e9chal C, Sagastiz\u00e1bal C (2006) Numerical Optimization: Theoretical and Practical Aspects. Springer Sci Bus Media"},{"key":"94_CR9","doi-asserted-by":"crossref","unstructured":"Borghetti A, Frangioni A, Lacalandra F, Nucci CA (2003) Lagrangian heuristics based on disaggregated bundle methods for hydrothermal unit commitment. IEEE Transact Power Syst 18(1):313\u2013323","DOI":"10.1109\/TPWRS.2002.807114"},{"issue":"1","key":"94_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1287\/trsc.1110.0378","volume":"46","author":"Valentina Cacchiani","year":"2012","unstructured":"Cacchiani V, Caprara A, Fischetti M (2012) A lagrangian heuristic for robustness, with an application to train timetabling. Transport Sci 46(1):124\u2013133","journal-title":"Transportation Science"},{"issue":"2","key":"94_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01581106","volume":"81","author":"Sebasti\u00e1n Ceria","year":"1998","unstructured":"Ceria S, Nobili P, Sassano A (1998) A lagrangian-based heuristic for large-scale set covering problems. Mathe Program 81(2):215\u2013228","journal-title":"Mathematical Programming"},{"key":"94_CR12","unstructured":"Conejo AJ, Castillo E, Minguez R, Garcia-Bertrand R (2006) Decomposition techniques in mathematical programming: engineering and science applications. Springer Sci Bus Media"},{"issue":"1","key":"94_CR13","first-page":"213","volume":"217","author":"Diego Jacinto Fiorotto and Silvio Alexandre de Araujo","year":"2014","unstructured":"Fiorotto DJ, de Araujo SA (2014) Reformulation and a lagrangian heuristic for lot sizing problem on parallel machines. Ann Operation Res 217(1):213\u2013231","journal-title":"Annals of Operations Research"},{"key":"94_CR14","doi-asserted-by":"crossref","unstructured":"Fisher ML (1981) The lagrangian relaxation method for solving integer programming problems. Manag Sci 27(1):1\u201318","DOI":"10.1287\/mnsc.27.1.1"},{"key":"94_CR15","doi-asserted-by":"crossref","unstructured":"Geoffrion AM (1974) Lagrangean relaxation for integer programming. In Approaches to integer programming, pages 82\u2013114. Springer","DOI":"10.1007\/BFb0120690"},{"key":"94_CR16","doi-asserted-by":"crossref","unstructured":"Guignard M (2004) Lagrangean relaxation. In M.\u00a0Resende and P.\u00a0Pardalos, editors, Handbook of Applied Optimization, volume\u00a011. Oxford University Press","DOI":"10.1007\/BF02579036"},{"key":"94_CR17","doi-asserted-by":"crossref","unstructured":"Guo Y, Lim A, Rodrigues B, Tang J (2005) Using a lagrangian heuristic for a combinatorial auction problem. In 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI\u201905), pages 5\u2013pp. IEEE","DOI":"10.1109\/ICTAI.2005.126"},{"key":"94_CR18","doi-asserted-by":"crossref","unstructured":"Held M, Karp RM (1970) The traveling-salesman problem and minimum spanning trees. Operation Res 18(6):1138\u20131162","DOI":"10.1287\/opre.18.6.1138"},{"key":"94_CR19","volume-title":"Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods","author":"JB Hiriart-Urruty and Claude Lemar\u00e9chal","year":"1993","unstructured":"Hiriart-Urruty JB, Lemar\u00e9chal C (1993) Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods. Springer-Verlag, New York"},{"key":"94_CR20","unstructured":"NTTData\u00a0Mathematical\u00a0Systems Inc. (2019)\u00a0 Numerical optimizer 21.1.0 user\u2019s manual. http:\/\/www.msi.co.jp\/nuopt\/. In Japanese"},{"key":"94_CR21","doi-asserted-by":"crossref","unstructured":"Kiwiel KC (1995) Approximations in proximal bundle methods and decomposition of convex programs. J Opt Theory App 84(3):529\u2013548","DOI":"10.1007\/BF02191984"},{"key":"94_CR22","doi-asserted-by":"crossref","unstructured":"Klincewicz JG, Luss H (1986) A lagrangian relaxation heuristic for capacitated facility location with single-source constraints. J Operation Res Soc 37(5):495\u2013500","DOI":"10.1057\/jors.1986.84"},{"issue":"3","key":"94_CR23","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1080\/02331939708844312","volume":"40","author":"T Larsson","year":"1997","unstructured":"Larsson T, Liu Z (1997) A lagrangean relaxation scheme for structured linear programs with application to multicommodity network flows. Optimization 40(3):247\u2013284","journal-title":"Optimization"},{"issue":"2","key":"94_CR24","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s101070050090","volume":"86","author":"Torbj\u00f6rn Larsson","year":"1999","unstructured":"Larsson T, Patriksson M, Str\u00f6mberg A-B (1999) Ergodic, primal convergence in dual subgradient schemes for convex programming. Math Program 86(2):283\u2013312","journal-title":"Mathematical Programming"},{"key":"94_CR25","doi-asserted-by":"crossref","unstructured":"Lee J-W , Mazumdar RR, Shroff NB (2005) Non-convex optimization and rate control for multi-class services in the internet. IEEE\/ACM Transact Network 13(4):827\u2013840","DOI":"10.1109\/TNET.2005.852876"},{"key":"94_CR26","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal C (2001) Lagrangian relaxation. In Computational Combinatorial Optimization, pages 112\u2013156. Springer","DOI":"10.1007\/3-540-45586-8_4"},{"key":"94_CR27","unstructured":"Li D, Sun X (2006) Nonlinear integer programming, volume\u00a084. Springer Sci Bus Media"},{"key":"94_CR28","doi-asserted-by":"crossref","unstructured":"Li J-Q, Mirchandani PB, Borenstein D (2009) A lagrangian heuristic for the real-time vehicle rescheduling problem. Transportation Research Part E: Logist Transport Rev 45(3):419\u2013433","DOI":"10.1016\/j.tre.2008.09.002"},{"key":"94_CR29","doi-asserted-by":"crossref","unstructured":"Lobo MS, Vandenberghe L, Boyd S, Lebret H (1998) Applications of second-order cone programming. Linear Algebra Its App 284(1\u20133):193\u2013228","DOI":"10.1016\/S0024-3795(98)10032-0"},{"issue":"11","key":"94_CR30","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1016\/j.cor.2011.01.016","volume":"38","author":"Fabrizio Marinelli","year":"2011","unstructured":"Marinelli F, Nocella S, Rossi F, Smriglio S (2011) A lagrangian heuristic for satellite range scheduling with resource constraints. Comp Operation Res 38(11):1572\u20131583","journal-title":"Computers & Operations Research"},{"issue":"4","key":"94_CR31","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1137\/070708111","volume":"19","author":"Angelia Nedi\u0107","year":"2009","unstructured":"Nedi\u0107 A, Ozdaglar A (2009) Approximate primal solutions and rate analysis for dual subgradient methods. SIAM J Opt 19(4):1757\u20131780","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"94_CR32","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1016\/j.ejor.2015.01.029","volume":"243","author":"Michael Patriksson","year":"2015","unstructured":"Patriksson M Str\u00f6mberg C (2015) Algorithms for the continuous nonlinear resource allocation problem: new implementations and numerical studies. Euro J Operation Res 243(3):703\u2013722","journal-title":"European Journal of Operational Research"},{"key":"94_CR33","doi-asserted-by":"crossref","unstructured":"Senne ELF, Lorena LAN (2000) Lagrangean\/surrogate heuristics for p-median problems. In Computing tools for modeling, optimization and simulation, pages 115\u2013130. Springer","DOI":"10.1007\/978-1-4615-4567-5_6"},{"key":"94_CR34","unstructured":"Shapiro JF (1979) Mathematical programming: structures and algorithms"},{"key":"94_CR35","doi-asserted-by":"crossref","unstructured":"Vujanic R, Esfahani PM, Goulart PJ, Mari\u00e9thoz S, Morari M (2016) A decomposition method for large scale milps, with performance guarantees and a power system application. Automatica 67:144\u2013156","DOI":"10.1016\/j.automatica.2016.01.006"},{"issue":"2","key":"94_CR36","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1080\/10556789808805723","volume":"10","author":"Hiroshi Yamashita","year":"1998","unstructured":"Yamashita H (1998) A globally convergent primal-dual interior point method for constrained optimization. Opt Methods Software 10(2):443\u2013469","journal-title":"Optimization Methods and Software"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00094-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-021-00094-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00094-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,27]],"date-time":"2021-12-27T06:21:44Z","timestamp":1640586104000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-021-00094-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,28]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["94"],"URL":"https:\/\/doi.org\/10.1007\/s43069-021-00094-9","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2021,10,28]]},"assertion":[{"value":"23 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the first author states that no conflict of interest exists related to this report or the study it describes.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"57"}}