{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T12:02:10Z","timestamp":1778155330246,"version":"3.51.4"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"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":["Math. Prog. Comp."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s12532-023-00239-3","type":"journal-article","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T15:02:33Z","timestamp":1685718153000},"page":"581-589","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":289,"title":["JuMP 1.0: recent improvements to a modeling language for mathematical optimization"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6781-9633","authenticated-orcid":false,"given":"Miles","family":"Lubin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1575-668X","authenticated-orcid":false,"given":"Oscar","family":"Dowson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7721-8564","authenticated-orcid":false,"given":"Joaquim Dias","family":"Garcia","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3552-0316","authenticated-orcid":false,"given":"Joey","family":"Huchette","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5921-368X","authenticated-orcid":false,"given":"Beno\u00eet","family":"Legat","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4335-7248","authenticated-orcid":false,"given":"Juan Pablo","family":"Vielma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"issue":"1","key":"239_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017)","journal-title":"SIAM Rev."},{"key":"239_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-68928-5","volume-title":"Pyomo\u2014Optimization Modeling in Python","author":"ML Bynum","year":"2021","unstructured":"Bynum, M.L., Hackebeil, G.A., Hart, W.E., Laird, C.D., Nicholson, B.L., Siirola, J.D., Watson, J.P., Woodruff, D.L.: Pyomo\u2014Optimization Modeling in Python, vol. 67. Springer, Berlin (2021)"},{"key":"239_CR3","doi-asserted-by":"crossref","unstructured":"Coffrin, C., Bent, R., Sundar, K., Ng, Y., Lubin, M.: PowerModels.jl: an open-source framework for exploring power flow formulations. In: 2018 Power Systems Computation Conference (PSCC), pp. 1\u20138. IEEE (2018)","DOI":"10.23919\/PSCC.2018.8442948"},{"key":"239_CR4","doi-asserted-by":"publisher","unstructured":"Dias Garcia, J., Bodin, G., Street, A.: BilevelJuMP.jl: Modeling and Solving Bilevel Optimization in Julia. arXiv preprint (2022). https:\/\/doi.org\/10.48550\/arXiv.2205.02307","DOI":"10.48550\/arXiv.2205.02307"},{"issue":"1","key":"239_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1287\/ijoc.2020.0987","volume":"33","author":"O Dowson","year":"2021","unstructured":"Dowson, O., Kapelevich, L.: SDDP.jl: a julia package for stochastic dual dynamic programming. INFORMS J. Comput. 33(1), 27\u201333 (2021)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"239_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"key":"239_CR7","unstructured":"Gurobi Optimization, LLC: Gurobi optimizer reference manual (2023). https:\/\/www.gurobi.com"},{"issue":"1","key":"239_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-017-0130-5","volume":"10","author":"Q Huangfu","year":"2018","unstructured":"Huangfu, Q., Hall, J.A.J.: Parallelizing the dual revised simplex method. Math. Program. Comput. 10(1), 119\u2013142 (2018)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"239_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.15388\/21-INFOR447","volume":"32","author":"V Jusevi\u010dius","year":"2021","unstructured":"Jusevi\u010dius, V., Oberdieck, R., Paulavi\u010dius, R.: Experimental analysis of algebraic modelling languages for mathematical optimization. Informatica 32(2), 283\u2013304 (2021)","journal-title":"Informatica"},{"issue":"2","key":"239_CR10","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1287\/ijoc.2021.1067","volume":"34","author":"B Legat","year":"2021","unstructured":"Legat, B., Dowson, O., Dias Garcia, J., Lubin, M.: MathOptInterface: a data structure for mathematical optimization problems. INFORMS J. Comput. 34(2), 672\u2013689 (2021)","journal-title":"INFORMS J. Comput."},{"key":"239_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2021.107567","volume":"156","author":"JL Pulsipher","year":"2022","unstructured":"Pulsipher, J.L., Zhang, W., Hongisto, T.J., Zavala, V.M.: A unifying modeling abstraction for infinite-dimensional optimization. Comput. Chem. Eng. 156, 107567 (2022)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"239_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-023-00239-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-023-00239-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-023-00239-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T15:17:18Z","timestamp":1690211838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-023-00239-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["239"],"URL":"https:\/\/doi.org\/10.1007\/s12532-023-00239-3","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"27 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2023","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"}}]}}