{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T20:34:10Z","timestamp":1768250050214,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T00:00:00Z","timestamp":1749427200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T00:00:00Z","timestamp":1749427200000},"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":["Optim Lett"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s11590-025-02211-7","type":"journal-article","created":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T04:14:43Z","timestamp":1749442483000},"page":"89-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Generator subadditive functions for mixed-integer programs"],"prefix":"10.1007","volume":"20","author":[{"given":"Gustavo","family":"Angulo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burak","family":"Kocuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2510-0433","authenticated-orcid":false,"given":"Diego A.","family":"Moran Ramirez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,9]]},"reference":[{"key":"2211_CR1","unstructured":"Ajayi, T., Gupte, A., Khademi, A., Schaefer, A.: On strong duality, theorems of the alternative, and projections in conic optimization, (2021)"},{"issue":"3","key":"2211_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.orl.2020.04.003","volume":"48","author":"T Ajayi","year":"2020","unstructured":"Ajayi, T., Suriyanarayana, V., Schaefer, A.J.: Theorems of the alternative for conic integer programming. Oper. Res. Lett. 48(3), 329\u2013335 (2020)","journal-title":"Oper. Res. Lett."},{"key":"2211_CR3","doi-asserted-by":"crossref","unstructured":"Aspman, J., Korpas, G., Marecek, J.: Taming binarized neural networks and mixed-integer programs. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 38, pp. 10935\u201310943 (2024)","DOI":"10.1609\/aaai.v38i10.28968"},{"key":"2211_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization. Society for Industrial and Applied Mathematics (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"2211_CR5","doi-asserted-by":"crossref","unstructured":"Cheung, K.K.H., Moazzez, B.: Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions. Adv. Oper. Res. (2016)","DOI":"10.1155\/2016\/5017369"},{"key":"2211_CR6","unstructured":"Dey, S.S., Meunier, F., Mor\u00e1n\u00a0R, D.A.: Geoffrion\u2019s theorem beyond finiteness and rationality. (2024)"},{"issue":"1","key":"2211_CR7","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10107-012-0538-7","volume":"141","author":"S.S Dey","year":"2013","unstructured":"Dey, S..S.: Some properties of convex hulls of integer points contained in general convex sets. Math. Program. 141(1), 507\u2013526 (2013)","journal-title":"Math. Program."},{"key":"2211_CR8","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Mor\u00e1n R, D.A.: Some properties of convex hulls of integer points contained in general convex sets. Math. Programm. 141(1), 507\u2013526 (2013)","DOI":"10.1007\/s10107-012-0538-7"},{"issue":"2","key":"2211_CR9","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02192177","volume":"88","author":"OE Flippo","year":"1996","unstructured":"Flippo, O.E., Rinnooy Kan, A.H.G.: Additively separable duality theory. J. Optim. Theory Appl. 88(2), 381\u2013397 (1996)","journal-title":"J. Optim. Theory Appl."},{"key":"2211_CR10","doi-asserted-by":"crossref","unstructured":"Geoffrion, A.M.: Lagrangian relaxation for integer programming. In 50 Years of Integer Programming 1958-2008. Springer (2010)","DOI":"10.1007\/978-3-540-68279-0_9"},{"issue":"3","key":"2211_CR11","first-page":"118","volume":"4","author":"M Guzelsoy","year":"2007","unstructured":"Guzelsoy, M., Ralphs, T.K.: Duality for mixed-integer linear programs. The Int. J. Oper. Res. 4(3), 118\u2013137 (2007)","journal-title":"The Int. J. Oper. Res."},{"issue":"1","key":"2211_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1137\/040616474","volume":"18","author":"R Hemmecke","year":"2007","unstructured":"Hemmecke, R., Weismantel, R.: Representation of sets of lattice points. SIAM J. Optim. 18(1), 133\u2013137 (2007)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2211_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1137\/090762671","volume":"21","author":"G Iyengar","year":"2011","unstructured":"Iyengar, G., Phillips, D.J., Stein, C.: Approximating semidefinite packing programs. SIAM J. Optim. 21(1), 231\u2013268 (2011)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2211_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0012-365X(78)90112-7","volume":"23","author":"R Jeroslow","year":"1978","unstructured":"Jeroslow, R.: Cutting-plane theory: algebraic methods. Discret. Math. 23(2), 121\u2013150 (1978)","journal-title":"Discret. Math."},{"issue":"2","key":"2211_CR15","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1287\/moor.3.2.145","volume":"3","author":"RG Jeroslow","year":"1978","unstructured":"Jeroslow, R.G.: Some basis theorems for integral monoids. Math. Oper. Res. 3(2), 145\u2013154 (1978)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2211_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01588222","volume":"17","author":"RG Jeroslow","year":"1979","unstructured":"Jeroslow, R.G.: Minimal inequalities. Math. Program. 17(1), 1\u201315 (1979)","journal-title":"Math. Program."},{"key":"2211_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BFb0120692","volume":"2","author":"EL Johnson","year":"1974","unstructured":"Johnson, E.L.: On the group problem for mixed integer programming. Math. Program. Study 2, 137\u2013179 (1974)","journal-title":"Math. Program. Study"},{"key":"2211_CR18","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1023\/B:COAP.0000044186.99585.51","volume":"29","author":"D Klabjan","year":"2004","unstructured":"Klabjan, D.: A practical algorithm for computing a subadditive dual function for set partitioning. Comput. Optim. Appl. 29, 347\u2013368 (2004)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2211_CR19","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.ejor.2006.10.009","volume":"183","author":"D Klabjan","year":"2007","unstructured":"Klabjan, D.: Subadditive approaches in integer programming. Eur. J. Oper. Res. 183(2), 525\u2013545 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2211_CR20","doi-asserted-by":"publisher","first-page":"2320","DOI":"10.1137\/18M1210812","volume":"29","author":"B Kocuk","year":"2019","unstructured":"Kocuk, B., Mor\u00e1n, R.D.A.: On subadditive duality for conic mixed-integer programs. SIAM J. Optim. 29(3), 2320\u20132336 (2019)","journal-title":"SIAM J. Optim."},{"key":"2211_CR21","doi-asserted-by":"crossref","unstructured":"De Loera, J.A., Marsters, B., Xu, L., Zhang, S.: Integer points in arbitrary convex cones: The case of the PSD and SOC cones (2024)","DOI":"10.1007\/s10107-024-02188-8"},{"issue":"1","key":"2211_CR22","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01585518","volume":"7","author":"RR Meyer","year":"1974","unstructured":"Meyer, R.R.: On the existence of optimal solutions to integer and mixed-integer programming problems. Math. Program. 7(1), 223\u2013235 (1974)","journal-title":"Math. Program."},{"issue":"3","key":"2211_CR23","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1137\/110840868","volume":"22","author":"RDA Mor\u00e1n","year":"2012","unstructured":"Mor\u00e1n, R.D.A., Dey, S.S., Vielma, J.P.: A strong dual for conic mixed-integer programs. SIAM J. Optim. 22(3), 1136\u20131150 (2012)","journal-title":"SIAM J. Optim."},{"key":"2211_CR24","volume-title":"Integer Combat. Optim.","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer Combat. Optim. Wiley-Interscience, New York (1988)"},{"key":"2211_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.disopt.2016.11.001","volume":"24","author":"A Santana","year":"2017","unstructured":"Santana, A., Dey, S.S.: Some cut-generating functions for second-order conic sets. Discret. Optim. 24, 51\u201365 (2017)","journal-title":"Discret. Optim."},{"key":"2211_CR26","unstructured":"Schrijver, A.: Theory of linear and integer programming. Wiley (1998)"},{"issue":"1","key":"2211_CR27","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01584248","volume":"21","author":"J Tind","year":"1981","unstructured":"Tind, J., Wolsey, L.A.: An elementary survey of general duality theory in mathematical programming. Math. Program. 21(1), 241\u2013261 (1981)","journal-title":"Math. Program."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-025-02211-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-025-02211-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-025-02211-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T04:19:44Z","timestamp":1768191584000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-025-02211-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,9]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["2211"],"URL":"https:\/\/doi.org\/10.1007\/s11590-025-02211-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,9]]},"assertion":[{"value":"29 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}