{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:37:14Z","timestamp":1756384634810,"version":"3.37.3"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T00:00:00Z","timestamp":1671667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T00:00:00Z","timestamp":1671667200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1807260","1818700","1930582"],"award-info":[{"award-number":["1807260","1818700","1930582"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["12951270"],"award-info":[{"award-number":["12951270"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2112533"],"award-info":[{"award-number":["2112533"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study the minimization of a rank-one quadratic with indicators and show that the underlying set function obtained by projecting out the continuous variables is supermodular. Although supermodular minimization is, in general, difficult, the specific set function for the rank-one quadratic can be minimized in linear time. We show that the convex hull of the epigraph of the quadratic can be obtained from inequalities for the underlying supermodular set function by lifting them into nonlinear inequalities in the original space of variables. Explicit forms of the convex-hull description are given, both in the original space of variables and in an extended formulation via conic quadratic-representable inequalities, along with a polynomial separation algorithm. Computational experiments indicate that the lifted supermodular inequalities in conic quadratic form are quite effective in reducing the integrality gap for quadratic optimization with indicators.<\/jats:p>","DOI":"10.1007\/s10107-022-01908-2","type":"journal-article","created":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T13:12:43Z","timestamp":1671714763000},"page":"295-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Supermodularity and valid inequalities for quadratic optimization with indicators"],"prefix":"10.1007","volume":"201","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1220-808X","authenticated-orcid":false,"given":"Alper","family":"Atamt\u00fcrk","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3668-0653","authenticated-orcid":false,"given":"Andr\u00e9s","family":"G\u00f3mez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,22]]},"reference":[{"issue":"1\u20132","key":"1908_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10107-009-0298-1","volume":"128","author":"S Ahmed","year":"2011","unstructured":"Ahmed, S., Atamt\u00fcrk, A.: Maximizing a class of submodular utility functions. Math. Program. 128(1\u20132), 149\u2013169 (2011)","journal-title":"Math. Program."},{"key":"1908_CR2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.orl.2008.12.009","volume":"37","author":"MS Akt\u00fcrk","year":"2009","unstructured":"Akt\u00fcrk, M.S., Atamt\u00fcrk, A., G\u00fcrel, S.: A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Oper. Res. Lett. 37, 187\u2013191 (2009)","journal-title":"Oper. Res. Lett."},{"key":"1908_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95, 3\u201351 (2003)","journal-title":"Math. Program."},{"key":"1908_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-6377(01)00100-6","volume":"29","author":"A Atamt\u00fcrk","year":"2001","unstructured":"Atamt\u00fcrk, A.: Flow pack facets of the single node fixed-charge flow polytope. Oper. Res. Lett. 29, 107\u2013114 (2001)","journal-title":"Oper. Res. Lett."},{"key":"1908_CR5","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.disopt.2015.07.003","volume":"18","author":"A Atamt\u00fcrk","year":"2015","unstructured":"Atamt\u00fcrk, A., Bhardwaj, A.: Supermodular covering knapsack polytope. Discret. Optim. 18, 74\u201386 (2015)","journal-title":"Discret. Optim."},{"key":"1908_CR6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-018-1301-5","volume":"170","author":"A Atamt\u00fcrk","year":"2018","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Strong formulations for quadratic optimization with M-matrices and indicator variables. Math. Program. 170, 141\u2013176 (2018)","journal-title":"Math. Program."},{"key":"1908_CR7","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Rank-one convexification for sparse regression (2019). arXiv:1901.10334"},{"issue":"2","key":"1908_CR8","first-page":"609","volume":"68","author":"A Atamt\u00fcrk","year":"2020","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Submodularity in conic quadratic mixed 0\u20131 optimization. Oper. Res. 68(2), 609\u2013630 (2020)","journal-title":"Oper. Res."},{"key":"1908_CR9","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10107-003-0465-8","volume":"99","author":"A Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk, A., Mu\u00f1oz, J.C.: A study of the lot-sizing polytope. Math. Program. 99, 443\u2013465 (2004)","journal-title":"Math. Program."},{"key":"1908_CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10107-020-01607-w","volume":"196","author":"A Atamt\u00fcrk","year":"2022","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Submodular function minimization and polarity. Math. Program. 196, 57\u201367 (2022)","journal-title":"Math. Program."},{"key":"1908_CR11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s101070100235","volume":"91","author":"A Atamt\u00fcrk","year":"2001","unstructured":"Atamt\u00fcrk, A., Nemhauser, G.L., Savelsbergh, M.W.P.: Valid inequalities for problems with additive variable upper bounds. Math. Program. 91, 145\u2013162 (2001)","journal-title":"Math. Program."},{"issue":"3","key":"1908_CR12","doi-asserted-by":"crossref","first-page":"1943","DOI":"10.1137\/15M1033009","volume":"27","author":"A Atamt\u00fcrk","year":"2017","unstructured":"Atamt\u00fcrk, A., K\u00fc\u00e7\u00fckyavuz, S., Tezel, B.: Path cover and path pack inequalities for the capacitated fixed-charge network flow problem. SIAM J. Optim. 27(3), 1943\u20131976 (2017)","journal-title":"SIAM J. Optim."},{"key":"1908_CR13","first-page":"1","volume":"22","author":"A Atamt\u00fcrk","year":"2021","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A., Han, S.: Sparse and smooth signal estimation: convexification of $$\\ell _0$$-formulations. J. Mach. Learn. Res. 22, 1\u20134 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"1908_CR14","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s10107-018-1248-6","volume":"175","author":"F Bach","year":"2019","unstructured":"Bach, F.: Submodular functions: from discrete to continuous domains. Math. Program. 175, 419\u2013459 (2019)","journal-title":"Math. Program."},{"key":"1908_CR15","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/opre.2015.1436","volume":"64","author":"D Bertsimas","year":"2015","unstructured":"Bertsimas, D., King, A.: Or forum\u2014an algorithmic approach to linear regression. Oper. Res. 64, 2\u201316 (2015)","journal-title":"Oper. Res."},{"issue":"2","key":"1908_CR16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02592208","volume":"74","author":"D Bienstock","year":"1996","unstructured":"Bienstock, D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74(2), 121\u2013140 (1996)","journal-title":"Math. Program."},{"key":"1908_CR17","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1137\/120878963","volume":"24","author":"D Bienstock","year":"2014","unstructured":"Bienstock, D., Michalka, A.: Cutting-planes for optimization of convex functions over nonconvex sets. SIAM J. Optim. 24, 643\u2013677 (2014)","journal-title":"SIAM J. Optim."},{"key":"1908_CR18","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10107-015-0891-4","volume":"151","author":"P Bonami","year":"2015","unstructured":"Bonami, P., Lodi, A., Tramontani, A., Wiese, S.: On mathematical programming with indicator constraints. Math. Program. 151, 191\u2013223 (2015)","journal-title":"Math. Program."},{"key":"1908_CR19","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S Ceria","year":"1999","unstructured":"Ceria, S., Soares, J.: Convex programming for disjunctive convex optimization. Math. Program. 86, 595\u2013614 (1999)","journal-title":"Math. Program."},{"key":"1908_CR20","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.compchemeng.2014.11.010","volume":"73","author":"A Cozad","year":"2015","unstructured":"Cozad, A., Sahinidis, N.V., Miller, D.C.: A combined first-principles and data-driven approach to model building. Comput. Chem. Eng. 73, 116\u2013127 (2015)","journal-title":"Comput. Chem. Eng."},{"key":"1908_CR21","first-page":"169","volume-title":"Proceedings of IPCO 2013","author":"H Dong","year":"2013","unstructured":"Dong, H., Linderoth, J.: On valid inequalities for quadratic programming with continuous variables and binary indicators. In: Goemans, M., Correa, J. (eds.) Proceedings of IPCO 2013, pp. 169\u2013180. Springer, Berlin (2013)"},{"key":"1908_CR22","unstructured":"Dong, H., Chen, K., Linderoth, J.: Regularization vs. relaxation: a conic optimization perspective of statistical variable selection (2015). arXiv:1510.06083"},{"key":"1908_CR23","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0594-3","volume":"106","author":"A Frangioni","year":"2006","unstructured":"Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0\u20131 mixed integer programs. Math. Program. 106, 225\u2013236 (2006)","journal-title":"Math. Program."},{"key":"1908_CR24","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.orl.2006.03.008","volume":"35","author":"A Frangioni","year":"2007","unstructured":"Frangioni, A., Gentile, C.: SDP diagonalizations and perspective cuts for a class of nonseparable MIQP. Oper. Res. Lett. 35, 181\u2013185 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1908_CR25","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1109\/TPWRS.2008.2004744","volume":"24","author":"A Frangioni","year":"2009","unstructured":"Frangioni, A., Gentile, C., Lacalandra, F.: Tighter approximated MILP formulations for unit commitment problems. IEEE Trans. Power Syst. 24(1), 105\u2013113 (2009)","journal-title":"IEEE Trans. Power Syst."},{"issue":"1","key":"1908_CR26","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/moor.2018.0969","volume":"45","author":"A Frangioni","year":"2020","unstructured":"Frangioni, A., Gentile, C., Hungerford, J.: Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs. Math. Oper. Res. 45(1), 15\u201333 (2020)","journal-title":"Math. Oper. Res."},{"key":"1908_CR27","volume-title":"Submodular Functions and Optimization","author":"S Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization, vol. 58. Elsevier, Amsterdam (2005)"},{"key":"1908_CR28","unstructured":"G\u00f3mez, A.: Submodularity and valid inequalities in nonlinear optimization with indicator variables (2018)"},{"key":"1908_CR29","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10107-020-01508-y","volume":"188","author":"A G\u00f3mez","year":"2020","unstructured":"G\u00f3mez, A.: Strong formulations for conic quadratic optimization with indicator variables. Math. Program. 188, 193\u2013226 (2020)","journal-title":"Math. Program."},{"key":"1908_CR30","doi-asserted-by":"crossref","first-page":"1897","DOI":"10.1137\/19M1306233","volume":"31","author":"A G\u00f3mez","year":"2021","unstructured":"G\u00f3mez, A.: Outlier detection in time series via mixed-integer conic quadratic optimization. SIAM J. Optim. 31, 1897\u20131925 (2021)","journal-title":"SIAM J. Optim."},{"key":"1908_CR31","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"1908_CR32","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10107-010-0360-z","volume":"124","author":"O G\u00fcnl\u00fck","year":"2010","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124, 183\u2013205 (2010)","journal-title":"Math. Program."},{"key":"1908_CR33","unstructured":"Han, S., G\u00f3mez, A., Atamt\u00fcrk, A.: 2x2 convexifications for convex quadratic optimization with indicator variables (2020). arXiv:2004.07448"},{"key":"1908_CR34","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10107-021-01712-4","volume":"196","author":"H Hazimeh","year":"2022","unstructured":"Hazimeh, H., Mazumder, R., Saab, A.: Sparse regression at scale: branch-and-bound rooted in first-order optimization. Math. Program. 196, 347\u2013388 (2022)","journal-title":"Math. Program."},{"key":"1908_CR35","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10589-011-9424-0","volume":"52","author":"H Hijazi","year":"2012","unstructured":"Hijazi, H., Bonami, P., Cornu\u00e9jols, G., Ouorou, A.: Mixed-integer nonlinear programs featuring \u201con\/off\u2019\u2019 constraints. Comput. Optim. Appl. 52, 537\u2013558 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"1908_CR36","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.disopt.2016.04.008","volume":"24","author":"H Jeon","year":"2017","unstructured":"Jeon, H., Linderoth, J., Miller, A.: Quadratic cone cutting surfaces for quadratic programs with on-off constraints. Discret. Optim. 24, 32\u201350 (2017)","journal-title":"Discret. Optim."},{"key":"1908_CR37","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10107-021-01688-1","volume":"195","author":"F K\u0131l\u0131n\u00e7-Karzan","year":"2022","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F., K\u00fc\u00e7\u00fckyavuz, S., Lee, D.: Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens. Math. Program. 195, 283\u2013326 (2022)","journal-title":"Math. Program."},{"key":"1908_CR38","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"MS Lobo","year":"1998","unstructured":"Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl. 284, 193\u2013228 (1998)","journal-title":"Linear Algebra Appl."},{"key":"1908_CR39","unstructured":"Mahajan, A., Leyffer, S., Linderoth, J., Luedtke, J., Munson, T.: Minotaur: a mixed-integer nonlinear optimization toolkit. ANL\/MCS-P8010-0817, Argonne National Lab (2017)"},{"key":"1908_CR40","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1287\/ijoo.2019.0040","volume":"3","author":"H Manzour","year":"2020","unstructured":"Manzour, H., K\u00fc\u00e7\u00fckyavuz, S., Shojaie, A.: Integer programming for learning directed acyclic graphs from continuous data. INFORMS J. Optim. 3, 46\u201373 (2020)","journal-title":"INFORMS J. Optim."},{"key":"1908_CR41","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, Hoboken (1988)"},{"key":"1908_CR42","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions\u2014I. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"2","key":"1908_CR43","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s10107-017-1138-3","volume":"169","author":"TT Nguyen","year":"2018","unstructured":"Nguyen, T.T., Richard, J.P.P., Tawarmalani, M.: Deriving convex hulls through lifting and projection. Math. Program. 169(2), 377\u2013415 (2018)","journal-title":"Math. Program."},{"key":"1908_CR44","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10107-007-0189-2","volume":"118","author":"JB Orlin","year":"2009","unstructured":"Orlin, J.B.: A faster strongly polynomial time algorithm for submodular function minimization. Math. Program. 118, 237\u2013251 (2009)","journal-title":"Math. Program."},{"issue":"4","key":"1908_CR45","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"MW Padberg","year":"1985","unstructured":"Padberg, M.W., Van Roy, T.J., Wolsey, L.A.: Valid linear inequalities for fixed charge problems. Oper. Res. 33(4), 842\u2013861 (1985)","journal-title":"Oper. Res."},{"key":"1908_CR46","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0167-6377(88)90076-4","volume":"7","author":"Y Pochet","year":"1988","unstructured":"Pochet, Y.: Valid inequalities and separation for capacitated economic lot sizing. Oper. Res. Lett. 7, 109\u2013115 (1988)","journal-title":"Oper. Res. Lett."},{"key":"1908_CR47","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10107-008-0226-9","volume":"121","author":"JPP Richard","year":"2010","unstructured":"Richard, J.P.P., Tawarmalani, M.: Lifting inequalities: a framework for generating strong cuts for nonlinear programs. Math. Program. 121, 61\u2013104 (2010)","journal-title":"Math. Program."},{"key":"1908_CR48","doi-asserted-by":"crossref","unstructured":"Shi, X., Prokopyev, O.A., Zeng, B.: Sequence independent lifting for the set of submodular maximization problem. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 378\u2013390. Springer (2020)","DOI":"10.1007\/978-3-030-45771-6_29"},{"key":"1908_CR49","first-page":"21,675","volume-title":"Advances in Neural Information Processing Systems","author":"C Tjandraatmadja","year":"2020","unstructured":"Tjandraatmadja, C., Anderson, R., Huchette, J., Ma, W., Patel, K.K., Vielma, J.P.: The convex relaxation barrier, revisited: tightened single-neuron relaxations for neural network verification. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M.F., Lin, H. (eds.) Advances in Neural Information Processing Systems, vol. 33, p. 21,675-21,686. Curran Associates Inc., Red Hook (2020)"},{"key":"1908_CR50","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(86)90061-2","volume":"14","author":"TJ Van Roy","year":"1986","unstructured":"Van Roy, T.J., Wolsey, L.A.: Valid inequalities for mixed 0\u20131 programs. Discret. Appl. Math. 14, 199\u2013213 (1986)","journal-title":"Discret. Appl. Math."},{"key":"1908_CR51","doi-asserted-by":"crossref","unstructured":"Wei, L., G\u00f3mez, A., K\u00fc\u00e7\u00fckyavuz, S.: On the convexification of constrained quadratic optimization problems with indicator variables. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 433\u2013447. Springer (2020)","DOI":"10.1007\/978-3-030-45771-6_33"},{"key":"1908_CR52","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10107-021-01734-y","volume":"192","author":"L Wei","year":"2022","unstructured":"Wei, L., G\u00f3mez, A., K\u00fc\u00e7\u00fckyavuz, S.: Ideal formulations for constrained convex optimization problems with indicator variables. Math. Program. 192, 57\u201388 (2022)","journal-title":"Math. Program."},{"key":"1908_CR53","doi-asserted-by":"crossref","unstructured":"Wei, L., Atamt\u00fcrk, A., G\u00f3mez, A., K\u00fc\u00e7\u00fckyavuz, S.: On the convex hull of convex quadratic optimization problems with indicators (2022). arXiv:2201.00387","DOI":"10.1007\/s10107-023-01982-0"},{"key":"1908_CR54","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(89)90036-9","volume":"8","author":"LA Wolsey","year":"1989","unstructured":"Wolsey, L.A.: Submodularity and valid inequalities in capacitated fixed charge networks. Oper. Res. Lett. 8, 119\u2013124 (1989)","journal-title":"Oper. Res. Lett."},{"key":"1908_CR55","doi-asserted-by":"crossref","first-page":"1531","DOI":"10.1137\/15M1012232","volume":"27","author":"B Wu","year":"2017","unstructured":"Wu, B., Sun, X., Li, D., Zheng, X.: Quadratic convex reformulations for semicontinuous quadratic programming. SIAM J. Optim. 27, 1531\u20131553 (2017)","journal-title":"SIAM J. Optim."},{"key":"1908_CR56","unstructured":"Wu, H.H., K\u00fc\u00e7\u00fckyavuz, S.: Maximizing influence in social networks: a two-stage stochastic programming approach that exploits submodularity (2015). arXiv:1512.04180"},{"key":"1908_CR57","doi-asserted-by":"crossref","first-page":"3359","DOI":"10.1137\/19M1245414","volume":"30","author":"W Xie","year":"2020","unstructured":"Xie, W., Deng, X.: Scalable algorithms for the sparse ridge regression. SIAM J. Optim. 30, 3359\u20133386 (2020)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1908_CR58","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10107-016-1033-3","volume":"162","author":"J Yu","year":"2017","unstructured":"Yu, J., Ahmed, S.: Maximizing a class of submodular utility functions with constraints. Math. Program. 162(1\u20132), 145\u2013164 (2017)","journal-title":"Math. Program."},{"key":"1908_CR59","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.disopt.2015.07.005","volume":"24","author":"J Yu","year":"2017","unstructured":"Yu, J., Ahmed, S.: Polyhedral results for a class of cardinality constrained submodular minimization problems. Discret. Optim. 24, 87\u2013102 (2017)","journal-title":"Discret. Optim."},{"key":"1908_CR60","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.orl.2020.10.007","volume":"49","author":"Q Yu","year":"2021","unstructured":"Yu, Q., K\u00fc\u00e7\u00fckyavuz, S.: A polyhedral approach to bisubmodular function minimization. Oper. Res. Lett. 49, 5\u201310 (2021)","journal-title":"Oper. Res. Lett."},{"key":"1908_CR61","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1287\/ijoc.2014.0592","volume":"26","author":"X Zheng","year":"2014","unstructured":"Zheng, X., Sun, X., Li, D.: Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach. INFORMS J. Comput. 26, 690\u2013703 (2014)","journal-title":"INFORMS J. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01908-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01908-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01908-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,3]],"date-time":"2023-12-03T12:05:55Z","timestamp":1701605155000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01908-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,22]]},"references-count":61,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1908"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01908-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2022,12,22]]},"assertion":[{"value":"29 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}