{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:24Z","timestamp":1759847544387,"version":"3.37.3"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T00:00:00Z","timestamp":1612742400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T00:00:00Z","timestamp":1612742400000},"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":["Math. Prog. Comp."],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s12532-020-00200-8","type":"journal-article","created":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T06:04:04Z","timestamp":1612850644000},"page":"509-551","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Design and implementation of a modular interior-point solver for linear optimization"],"prefix":"10.1007","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9967-0578","authenticated-orcid":false,"given":"Mathieu","family":"Tanneau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8258-9116","authenticated-orcid":false,"given":"Miguel F.","family":"Anjos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9269-633X","authenticated-orcid":false,"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,8]]},"reference":[{"issue":"2","key":"200_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF01586000","volume":"71","author":"ED Andersen","year":"1995","unstructured":"Andersen, E.D., Andersen, K.D.: Presolving in linear programming. Math. Program. 71(2), 221\u2013245 (1995). https:\/\/doi.org\/10.1007\/BF01586000","journal-title":"Math. Program."},{"key":"200_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-1-4757-3216-0_8","volume-title":"The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm","author":"ED Andersen","year":"2000","unstructured":"Andersen, E.D., Andersen, K.D.: The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm, pp. 197\u2013232. Springer, Boston (2000). https:\/\/doi.org\/10.1007\/978-1-4757-3216-0_8"},{"issue":"4","key":"200_CR3","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1137\/06066847X","volume":"18","author":"MF Anjos","year":"2008","unstructured":"Anjos, M.F., Burer, S.: On handling free variables in interior-point methods for conic linear optimization. SIAM J. Optim. 18(4), 1310\u20131325 (2008). https:\/\/doi.org\/10.1137\/06066847X","journal-title":"SIAM J. Optim."},{"issue":"1","key":"200_CR4","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/TPWRS.2018.2867476","volume":"34","author":"MF Anjos","year":"2019","unstructured":"Anjos, M.F., Lodi, A., Tanneau, M.: A decentralized framework for the optimal coordination of distributed energy resources. IEEE Trans. Power Syst. 34(1), 349\u2013359 (2019). https:\/\/doi.org\/10.1109\/TPWRS.2018.2867476","journal-title":"IEEE Trans. Power Syst."},{"issue":"1","key":"200_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10107-007-0151-3","volume":"120","author":"F Babonneau","year":"2009","unstructured":"Babonneau, F., Vial, J.P.: Accpm with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems. Math. program. 120(1), 179\u2013210 (2009)","journal-title":"Math. program."},{"issue":"1","key":"200_CR6","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238\u2013252 (1962). https:\/\/doi.org\/10.1007\/BF01386316","journal-title":"Numer. Math."},{"issue":"1","key":"200_CR7","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). https:\/\/doi.org\/10.1137\/141000671","journal-title":"SIAM Rev."},{"issue":"12","key":"200_CR8","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1287\/mnsc.34.12.1472","volume":"34","author":"JR Birge","year":"1988","unstructured":"Birge, J.R., Qi, L.: Computing block-angular karmarkar projections with applications to stochastic programming. Manag. Sci. 34(12), 1472\u20131479 (1988)","journal-title":"Manag. Sci."},{"issue":"5","key":"200_CR9","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1287\/opre.40.5.885","volume":"40","author":"RE Bixby","year":"1992","unstructured":"Bixby, R.E., Gregory, J.W., Lustig, I.J., Marsten, R.E., Shanno, D.F.: Very large-scale linear programming: a case study in combining interior point and simplex methods. Oper. Res. 40(5), 885\u2013897 (1992). https:\/\/doi.org\/10.1287\/opre.40.5.885","journal-title":"Oper. Res."},{"issue":"1","key":"200_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1080\/10556788.2015.1050014","volume":"31","author":"J Castro","year":"2016","unstructured":"Castro, J.: Interior-point solver for convex separable block-angular problems. Optim. Methods Softw. 31(1), 88\u2013109 (2016). https:\/\/doi.org\/10.1080\/10556788.2015.1050014","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"200_CR11","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10107-016-1067-6","volume":"163","author":"J Castro","year":"2017","unstructured":"Castro, J., Nasini, S., Saldanha-da Gama, F.: A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method. Math. Program. 163(1), 411\u2013444 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1067-6","journal-title":"Math. Program."},{"issue":"1","key":"200_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01581258","volume":"58","author":"IC Choi","year":"1993","unstructured":"Choi, I.C., Goldfarb, D.: Exploiting special structure in a primal\u2013dual path-following algorithm. Math. Program. 58(1), 33\u201352 (1993). https:\/\/doi.org\/10.1007\/BF01581258","journal-title":"Math. Program."},{"key":"200_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume-title":"Oper. Res.","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res., pp. 101\u2013111. (1960). https:\/\/doi.org\/10.1287\/opre.8.1.101"},{"key":"200_CR14","unstructured":"Davis, T.A.: SuiteSparse: a suite of sparse matrix software. http:\/\/faculty.cse.tamu.edu\/davis\/suitesparse.html"},{"key":"200_CR15","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M.M.: Column generation, GERAD 25th anniversary, vol. 5, 1 edn. Springer Science & Business Media (2006)","DOI":"10.1007\/b135457"},{"issue":"83","key":"200_CR16","first-page":"1","volume":"17","author":"S Diamond","year":"2016","unstructured":"Diamond, S., Boyd, S.: CVXPY: a python-embedded modeling language for convex optimization. J. Mach. Learn. Res. 17(83), 1\u20135 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"200_CR17","doi-asserted-by":"crossref","unstructured":"Domahidi, A., Chu, E., Boyd, S.: ECOS: An SOCP solver for embedded systems. In: European Control Conference (ECC), pp. 3071\u20133076 (2013)","DOI":"10.23919\/ECC.2013.6669541"},{"issue":"2","key":"200_CR18","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."},{"issue":"2","key":"200_CR19","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10107-003-0469-4","volume":"100","author":"S Elhedhli","year":"2004","unstructured":"Elhedhli, S., Goffin, J.L.: The integration of an interior-point cutting plane method within a branch-and-price algorithm. Math. Program. 100(2), 267\u2013294 (2004)","journal-title":"Math. Program."},{"key":"200_CR20","doi-asserted-by":"publisher","unstructured":"Forrest, J., Vigerske, S., Ralph, T., Hafer, L., jpfasano, Santos, H.G., Saltzman, M., Gassmann, H., Kristjansson, B., King, A.: coin-or\/Clp: version 1.17.6 (2020). https:\/\/doi.org\/10.5281\/zenodo.3748677","DOI":"10.5281\/zenodo.3748677"},{"issue":"1","key":"200_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s12532-012-0035-2","volume":"4","author":"MP Friedlander","year":"2012","unstructured":"Friedlander, M.P., Orban, D.: A primal-dual regularized interior-point method for convex quadratic programs. Math. Program. Comput. 4(1), 71\u2013107 (2012). https:\/\/doi.org\/10.1007\/s12532-012-0035-2","journal-title":"Math. Program. Comput."},{"issue":"1","key":"200_CR22","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/641876.641880","volume":"29","author":"EM Gertz","year":"2003","unstructured":"Gertz, E.M., Wright, S.J.: Object-oriented software for quadratic programming. ACM Trans. Math. Softw. 29(1), 58\u201381 (2003). https:\/\/doi.org\/10.1145\/641876.641880","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"200_CR23","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1287\/ijoc.2016.0692","volume":"28","author":"AM Gleixner","year":"2016","unstructured":"Gleixner, A.M., Steffy, D.E., Wolter, K.: Iterative refinement for linear programming. INFORMS J. Comput. 28(3), 449\u2013464 (2016). https:\/\/doi.org\/10.1287\/ijoc.2016.0692","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"200_CR24","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF00249643","volume":"6","author":"J Gondzio","year":"1996","unstructured":"Gondzio, J.: Multiple centrality corrections in a primal-dual method for linear programming. Comput. Optim. Appl. 6(2), 137\u2013156 (1996). https:\/\/doi.org\/10.1007\/BF00249643","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"200_CR25","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/ijoc.9.1.73","volume":"9","author":"J Gondzio","year":"1997","unstructured":"Gondzio, J.: Presolve analysis of linear programs prior to applying an interior point method. INFORMS J. Comput. 9(1), 73\u201391 (1997). https:\/\/doi.org\/10.1287\/ijoc.9.1.73","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"200_CR26","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.ejor.2011.09.017","volume":"218","author":"J Gondzio","year":"2012","unstructured":"Gondzio, J.: Interior point methods 25 years later. Eur. J. Oper. Res. 218(3), 587\u2013601 (2012). https:\/\/doi.org\/10.1016\/j.ejor.2011.09.017","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"200_CR27","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ejor.2012.07.024","volume":"224","author":"J Gondzio","year":"2013","unstructured":"Gondzio, J., Gonzalez-Brevis, P., Munari, P.: New developments in the primal-dual column generation technique. Eur. J. Oper. Res. 224(1), 41\u201351 (2013). https:\/\/doi.org\/10.1016\/j.ejor.2012.07.024","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"200_CR28","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s12532-015-0090-6","volume":"8","author":"J Gondzio","year":"2016","unstructured":"Gondzio, J., Gonz\u00e1lez-Brevis, P., Munari, P.: Large-scale optimization with the primal-dual column generation method. Math. Program. Computation 8(1), 47\u201382 (2016). https:\/\/doi.org\/10.1007\/s12532-015-0090-6","journal-title":"Math. Program. Computation"},{"issue":"1","key":"200_CR29","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10479-006-0139-z","volume":"152","author":"J Gondzio","year":"2007","unstructured":"Gondzio, J., Grothey, A.: Parallel interior-point solver for structured quadratic programs: application to financial planning problems. Ann. Oper. Res. 152(1), 319\u2013339 (2007). https:\/\/doi.org\/10.1007\/s10479-006-0139-z","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"200_CR30","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10287-008-0090-3","volume":"6","author":"J Gondzio","year":"2009","unstructured":"Gondzio, J., Grothey, A.: Exploiting structure in parallel implementation of interior point methods for optimization. Comput. Manag. Sci. 6(2), 135\u2013160 (2009). https:\/\/doi.org\/10.1007\/s10287-008-0090-3","journal-title":"Comput. Manag. Sci."},{"key":"200_CR31","unstructured":"Gondzio, J., Sarkissian, R.: Column generation with a primal-dual method. Technical report 96.6, Logilab (1996). https:\/\/www.maths.ed.ac.uk\/~gondzio\/reports\/pdcgm.pdf"},{"issue":"3","key":"200_CR32","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s10107-003-0379-5","volume":"96","author":"J Gondzio","year":"2003","unstructured":"Gondzio, J., Sarkissian, R.: Parallel interior-point solver for structured linear programs. Math. Program. 96(3), 561\u2013584 (2003). https:\/\/doi.org\/10.1007\/s10107-003-0379-5","journal-title":"Math. Program."},{"issue":"3","key":"200_CR33","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/S0377-2217(96)00182-8","volume":"101","author":"J Gondzio","year":"1997","unstructured":"Gondzio, J., Sarkissian, R., Vial, J.P.: Using an interior point method for the master problem in a decomposition approach. Eur. J. Oper. Res. 101(3), 577\u2013587 (1997). https:\/\/doi.org\/10.1016\/S0377-2217(96)00182-8","journal-title":"Eur. J. Oper. Res."},{"key":"200_CR34","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-0-387-09707-7_13","volume-title":"A Structure Conveying Parallelizable Modeling Language for Mathematical Programming","author":"A Grothey","year":"2009","unstructured":"Grothey, A., Hogg, J., Colombo, M., Gondzio, J.: A Structure Conveying Parallelizable Modeling Language for Mathematical Programming, pp. 145\u2013156. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-09707-7_13"},{"key":"200_CR35","unstructured":"Gurobi Optimization, L.: Gurobi optimizer reference manual (2018). https:\/\/www.gurobi.com"},{"issue":"3","key":"200_CR36","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s12532-011-0026-8","volume":"3","author":"WE Hart","year":"2011","unstructured":"Hart, W.E., Watson, J.P., Woodruff, D.L.: Pyomo: modeling and solving mathematical programs in python. Math. Program. Comput. 3(3), 219\u2013260 (2011)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"200_CR37","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1287\/ijoc.4.1.38","volume":"4","author":"JK Hurd","year":"1992","unstructured":"Hurd, J.K., Murphy, F.H.: Exploiting special structure in primal dual interior point methods. ORSA J. Comput. 4(1), 38\u201344 (1992). https:\/\/doi.org\/10.1287\/ijoc.4.1.38","journal-title":"ORSA J. Comput."},{"key":"200_CR38","unstructured":"IBM: IBM ILOG CPLEX Optimization Studio. https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio"},{"issue":"4","key":"200_CR39","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1137\/0804048","volume":"4","author":"ER Jessup","year":"1994","unstructured":"Jessup, E.R., Yang, D., Zenios, S.A.: Parallel factorization of structured matrices arising in stochastic programming. SIAM J. Optim. 4(4), 833\u2013846 (1994). https:\/\/doi.org\/10.1137\/0804048","journal-title":"SIAM J. Optim."},{"issue":"4","key":"200_CR40","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"J Kelley Jr","year":"1960","unstructured":"Kelley Jr., J.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8(4), 703\u2013712 (1960). https:\/\/doi.org\/10.1137\/0108053","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"200_CR41","unstructured":"Legat, B., Dowson, O., Garcia, J.D., Lubin, M.: MathOptInterface: a data structure for mathematical optimization problems. (2020). arXiv:2002.03447 [math]"},{"key":"200_CR42","unstructured":"L\u00f6fberg, J.: Yalmip : A toolbox for modeling and optimization in matlab. In: Proceedings of the CACSD Conference. Taipei, Taiwan (2004)"},{"key":"200_CR43","doi-asserted-by":"publisher","unstructured":"Lubin, M., Petra, C.G., Anitescu, M., Zavala, V.: Scalable stochastic optimization of complex energy systems. In: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, SC \u201911, pp. 64:1\u201364:64. ACM, New York, NY, USA (2011). https:\/\/doi.org\/10.1145\/2063384.2063470","DOI":"10.1145\/2063384.2063470"},{"key":"200_CR44","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-17689-5_9","volume-title":"Numerical Analysis and Optimization","author":"D Ma","year":"2015","unstructured":"Ma, D., Saunders, M.A.: Solving multiscale linear programs using the simplex method in quadruple precision. In: Al-Baali, M., Grandinetti, L., Purnama, A. (eds.) Numerical Analysis and Optimization, pp. 223\u2013235. Springer International Publishing, Cham (2015)"},{"key":"200_CR45","unstructured":"Makhorin, A.: GNU Linear Programming Kit, version 4.64 (2017). https:\/\/www.gnu.org\/software\/glpk\/glpk.html"},{"issue":"4","key":"200_CR46","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992). https:\/\/doi.org\/10.1137\/0802028","journal-title":"SIAM J. Optim."},{"key":"200_CR47","doi-asserted-by":"publisher","unstructured":"Mitchell, J.E.: Cutting plane methods and subgradient methods. In: Decision Technologies and Applications, chap. 2, pp. 34\u201361. INFORMS (2009). https:\/\/doi.org\/10.1287\/educ.1090.0064","DOI":"10.1287\/educ.1090.0064"},{"key":"200_CR48","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-1-4757-3216-0_14","volume-title":"Solving Linear Ordering Problems with a Combined Interior Point\/Simplex Cutting Plane Algorithm","author":"JE Mitchell","year":"2000","unstructured":"Mitchell, J.E., Borchers, B.: Solving Linear Ordering Problems with a Combined Interior Point\/Simplex Cutting Plane Algorithm, pp. 349\u2013366. Springer, Boston (2000). https:\/\/doi.org\/10.1007\/978-1-4757-3216-0_14"},{"key":"200_CR49","unstructured":"MOSEK ApS: The MOSEK Optimization Suite. https:\/\/www.mosek.com\/"},{"issue":"8","key":"200_CR50","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1016\/j.cor.2013.02.028","volume":"40","author":"P Munari","year":"2013","unstructured":"Munari, P., Gondzio, J.: Using the primal-dual interior point algorithm within the branch-price-and-cut method. Comput. Oper. Res. 40(8), 2026\u20132036 (2013). https:\/\/doi.org\/10.1016\/j.cor.2013.02.028","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"200_CR51","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10479-010-0806-y","volume":"210","author":"J Naoum-Sawaya","year":"2013","unstructured":"Naoum-Sawaya, J., Elhedhli, S.: An interior-point benders based branch-and-cut algorithm for mixed integer programs. Ann. Oper. Res. 210(1), 33\u201355 (2013)","journal-title":"Ann. Oper. Res."},{"key":"200_CR52","doi-asserted-by":"publisher","unstructured":"Orban, D., contributors: LDLFactorizations.jl: Factorization of symmetric matrices. https:\/\/github.com\/JuliaSmoothOptimizers\/LDLFactorizations.jl (2020). https:\/\/doi.org\/10.5281\/zenodo.3900668","DOI":"10.5281\/zenodo.3900668"},{"issue":"5","key":"200_CR53","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1016\/j.orl.2006.11.004","volume":"35","author":"LM Rousseau","year":"2007","unstructured":"Rousseau, L.M., Gendreau, M., Feillet, D.: Interior point stabilization for column generation. Oper. Res. Lett. 35(5), 660\u2013668 (2007). https:\/\/doi.org\/10.1016\/j.orl.2006.11.004","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"200_CR54","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1137\/0801035","volume":"1","author":"GL Schultz","year":"1991","unstructured":"Schultz, G.L., Meyer, R.R.: An interior point method for block angular optimization. SIAM J. Optim. 1(4), 583\u2013602 (1991). https:\/\/doi.org\/10.1137\/0801035","journal-title":"SIAM J. Optim."},{"key":"200_CR55","doi-asserted-by":"publisher","unstructured":"Tanneau, M.: Tulip.jl (2020). https:\/\/doi.org\/10.5281\/zenodo.3787950. https:\/\/github.com\/ds4dm\/Tulip.jl","DOI":"10.5281\/zenodo.3787950"},{"key":"200_CR56","doi-asserted-by":"crossref","unstructured":"Udell, M., Mohan, K., Zeng, D., Hong, J., Diamond, S., Boyd, S.: Convex optimization in Julia. In: Proceedings of the 1st Workshop for High Performance Technical Computing in Dynamic Languages, pp. 18\u201328. IEEE Press (2014)","DOI":"10.1109\/HPTCDL.2014.5"},{"key":"200_CR57","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"19","author":"T Westerlund","year":"1995","unstructured":"Westerlund, T., Pettersson, F.: An extended cutting plane method for solving convex minlp problems. Comput. Chem. Eng. 19, 131\u2013136 (1995). https:\/\/doi.org\/10.1016\/0098-1354(95)87027-X","journal-title":"Comput. Chem. Eng."},{"key":"200_CR58","doi-asserted-by":"publisher","unstructured":"Wright, S.: Primal\u2013Dual Interior-Point Methods. Society for Industrial and Applied Mathematics (1997). https:\/\/doi.org\/10.1137\/1.9781611971453","DOI":"10.1137\/1.9781611971453"},{"issue":"1","key":"200_CR59","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02206815","volume":"62","author":"X Xu","year":"1996","unstructured":"Xu, X., Hung, P.F., Ye, Y.: A simplified homogeneous and self-dual linear programming algorithm and its implementation. Ann. Oper. Res. 62(1), 151\u2013171 (1996). https:\/\/doi.org\/10.1007\/BF02206815","journal-title":"Ann. Oper. Res."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-020-00200-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-020-00200-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-020-00200-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T17:03:23Z","timestamp":1629219803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-020-00200-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,8]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["200"],"URL":"https:\/\/doi.org\/10.1007\/s12532-020-00200-8","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"type":"print","value":"1867-2949"},{"type":"electronic","value":"1867-2957"}],"subject":[],"published":{"date-parts":[[2021,2,8]]},"assertion":[{"value":"25 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}