{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:34:09Z","timestamp":1760056449512,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031931116"},{"type":"electronic","value":"9783031931123"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-93112-3_14","type":"book-chapter","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T04:55:48Z","timestamp":1749531348000},"page":"184-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lagrangian Dual for\u00a0Integer Optimization with\u00a0Zero Duality Gap that\u00a0Admits Decomposition"],"prefix":"10.1007","author":[{"given":"Diego","family":"Cifuentes","sequence":"first","affiliation":[]},{"given":"Santanu\u00a0S.","family":"Dey","sequence":"additional","affiliation":[]},{"given":"Jingye","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,4]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1287\/opre.38.2.217","volume":"38","author":"WP Adams","year":"1990","unstructured":"Adams, W.P., Sherali, H.D.: Linearization strategies for a class of zero-one mixed integer programming problems. Oper. Res. 38(2), 217\u2013226 (1990)","journal-title":"Oper. Res."},{"issue":"6","key":"14_CR2","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/j.orl.2013.07.009","volume":"41","author":"S Ahmed","year":"2013","unstructured":"Ahmed, S.: A scenario decomposition algorithm for 0\u20131 stochastic programs. Oper. Res. Lett. 41(6), 565\u2013569 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/ijoc.2016.0695","volume":"28","author":"G Angulo","year":"2016","unstructured":"Angulo, G., Ahmed, S., Dey, S.S.: Improving the integer l-shaped method. INFORMS J. Comput. 28(3), 483\u2013499 (2016)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1287\/moor.2014.0673","volume":"40","author":"G Angulo","year":"2015","unstructured":"Angulo, G., Ahmed, S., Dey, S.S., Kaibel, V.: Forbidden vertices. Math. Oper. Res. 40(2), 350\u2013360 (2015)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"14_CR5","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1002\/aic.690100626","volume":"10","author":"R Aris","year":"1964","unstructured":"Aris, R., Nemhauser, G.L., Wilde, D.J.: Optimization of multistage cyclic and braching systems by serial procedures. AIChE J. 10(6), 913\u2013919 (1964)","journal-title":"AIChE J."},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08114-4","volume-title":"Introduction to Nonsmooth Optimization: Theory, Practice and Software","author":"A Bagirov","year":"2014","unstructured":"Bagirov, A., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Introduction to Nonsmooth Optimization: Theory, Practice and Software, vol. 12. Springer, Heidelberg (2014)"},{"key":"14_CR7","unstructured":"Beltran, C., Tadonki, C., Vial, J.P.: Semi-lagrangian relaxation. HEC Gen\u00e8ve (2004)"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-014-0761-5","volume":"149","author":"M Bergner","year":"2015","unstructured":"Bergner, M., et al.: Automatic dantzig-wolfe reformulation of mixed integer programs. Math. Program. 149(1), 391\u2013424 (2015)","journal-title":"Math. Program."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Bertele, U., Brioschi, F.: On non-serial dynamic programming. J. Comb. Theory, Ser. A 14(2), 137\u2013148 (1973)","DOI":"10.1016\/0097-3165(73)90016-2"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/15M1054079","volume":"28","author":"D Bienstock","year":"2018","unstructured":"Bienstock, D., Munoz, G.: Lp formulations for polynomial optimization problems. SIAM J. Optim. 28(2), 1121\u20131150 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1137\/16M1076290","volume":"28","author":"N Boland","year":"2018","unstructured":"Boland, N., et al.: Combining progressive hedging with a frank-wolfe method to compute lagrangian dual bounds in stochastic mixed-integer programming. SIAM J. Optim. 28(2), 1312\u20131336 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120(2), 479\u2013495 (2009)","journal-title":"Math. Program."},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s10107-021-01753-9","volume":"196","author":"R Chen","year":"2022","unstructured":"Chen, R., Luedtke, J.: On sample average approximation for two-stage stochastic programs without relatively complete recourse. Math. Program. 196(1), 719\u2013754 (2022)","journal-title":"Math. Program."},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Cifuentes, D., Dey, S.S., Xu, J.: Sensitivity analysis for mixed binary quadratic programming. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 446\u2013459. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-59835-7_33","DOI":"10.1007\/978-3-031-59835-7_33"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1287\/moor.2017.0866","volume":"43","author":"SS Dey","year":"2018","unstructured":"Dey, S.S., Molinaro, M., Wang, Q.: Analysis of sparse cutting planes for sparse milps with applications to stochastic milps. Math. Oper. Res. 43(1), 304\u2013332 (2018)","journal-title":"Math. Oper. Res."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph theory. Springer (print edition); Reinhard Diestel (eBooks) (2024)","DOI":"10.1007\/978-3-662-70107-2_7"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-016-1012-8","volume":"161","author":"MJ Feizollahi","year":"2017","unstructured":"Feizollahi, M.J., Ahmed, S., Sun, A.: Exact augmented lagrangian duality for mixed integer linear programming. Math. Program. 161, 365\u2013387 (2017)","journal-title":"Math. Program."},{"issue":"3","key":"14_CR18","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D Fulkerson","year":"1965","unstructured":"Fulkerson, D., Gross, O.: Incidence matrices and interval graphs. Pac. J. Math. 15(3), 835\u2013855 (1965)","journal-title":"Pac. J. Math."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Geoffrion, A.M.: Lagrangean relaxation for integer programming. In: Approaches to Integer Programming, pp. 82\u2013114. Springer, Heidelberg (2009)","DOI":"10.1007\/BFb0120690"},{"issue":"3","key":"14_CR20","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner, A., et al.: Miplib 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3), 443\u2013490 (2021)","journal-title":"Math. Program. Comput."},{"key":"14_CR21","unstructured":"Goulart, P.J., Chen, Y.: Clarabel: An interior-point solver for conic programs with quadratic objectives. arXiv preprint arXiv:2405.12762 (2024)"},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1137\/19M1271695","volume":"30","author":"X Gu","year":"2020","unstructured":"Gu, X., Ahmed, S., Dey, S.S.: Exact augmented lagrangian duality for mixed integer quadratic programming. SIAM J. Optim. 30(1), 781\u2013797 (2020)","journal-title":"SIAM J. Optim."},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Higle, J.L.: Stochastic programming: optimization when uncertainty matters. In: Emerging theory, methods, and applications, pp. 30\u201353. Informs (2005)","DOI":"10.1287\/educ.1053.0016"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: An introduction to two-stage stochastic mixed-integer programming. In: Leading Developments from INFORMS Communities, pp. 1\u201327. INFORMS (2017)","DOI":"10.1287\/educ.2017.0171"},{"issue":"3","key":"14_CR25","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G Laporte","year":"1993","unstructured":"Laporte, G., Louveaux, F.V.: The integer l-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3), 133\u2013142 (1993)","journal-title":"Oper. Res. Lett."},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Emerging Applications of Algebraic Geometry, pp. 157\u2013270. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-0-387-09686-5_7","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/PL00011429","volume":"90","author":"C Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal, C., Renaud, A.: A geometric study of duality gaps, with applications. Math. Program. 90, 399\u2013427 (2001)","journal-title":"Math. Program."},{"issue":"18","key":"14_CR28","doi-asserted-by":"publisher","first-page":"2031","DOI":"10.1016\/j.dam.2010.08.020","volume":"158","author":"M Minoux","year":"2010","unstructured":"Minoux, M., Ouzia, H.: Drl*: a hierarchy of strong block-decomposable linear relaxations for 0\u20131 mips. Disc. Appl. Math. 158(18), 2031\u20132048 (2010)","journal-title":"Disc. Appl. Math."},{"key":"14_CR29","volume-title":"Introduction to Dynamic Programming","author":"G Nemhauser","year":"1966","unstructured":"Nemhauser, G.: Introduction to Dynamic Programming. John Wiley, New York (1966)"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. ii. Algorithmic aspects of tree-width. J. Algor. 7(3), 309\u2013322 (1986)","DOI":"10.1016\/0196-6774(86)90023-4"},{"issue":"3","key":"14_CR31","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1137\/0314038","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T., Wets, R.J.: Stochastic convex programming: relatively complete recourse and induced feasibility. SIAM J. Control. Optim. 14(3), 574\u2013589 (1976)","journal-title":"SIAM J. Control. Optim."},{"issue":"2","key":"14_CR32","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1137\/22M1487321","volume":"34","author":"K Sun","year":"2024","unstructured":"Sun, K., Sun, M., Yin, W.: Decomposition methods for global solution of mixed-integer linear programs. SIAM J. Optim. 34(2), 1206\u20131235 (2024)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"14_CR33","doi-asserted-by":"publisher","first-page":"1933","DOI":"10.1137\/13092678X","volume":"24","author":"M Zhang","year":"2014","unstructured":"Zhang, M., Kucukyavuz, S.: Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs. SIAM J. Optim. 24(4), 1933\u20131951 (2014)","journal-title":"SIAM J. Optim."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-93112-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T10:53:28Z","timestamp":1760007208000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-93112-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031931116","9783031931123"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-93112-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"4 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Baltimore, MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco25.cs.jhu.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}