{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T08:13:18Z","timestamp":1783584798427,"version":"3.55.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,5,24]],"date-time":"2012-05-24T00:00:00Z","timestamp":1337817600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s10107-012-0545-8","type":"journal-article","created":{"date-parts":[[2012,5,23]],"date-time":"2012-05-23T05:19:54Z","timestamp":1337750394000},"page":"305-322","source":"Crossref","is-referenced-by-count":5,"title":["Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes"],"prefix":"10.1007","volume":"134","author":[{"given":"Michel","family":"Baes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alberto","family":"Del Pia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yurii","family":"Nesterov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shmuel","family":"Onn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,5,24]]},"reference":[{"issue":"3","key":"545_CR1","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1137\/070696465","volume":"22","author":"Y. Berstein","year":"2008","unstructured":"Berstein Y., Lee J., Onn S., Maruri H., Riccomagno E., Wynn H., Weismantel R.: Nonlinear matroid optimization and experimental design. SIAM J. Discret. Math. 22(3), 901\u2013919 (2008)","journal-title":"SIAM J. Discret. Math."},{"key":"545_CR2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10107-010-0358-6","volume":"124","author":"Y. Berstein","year":"2010","unstructured":"Berstein Y., Lee J., Onn S., Weismantel R.: Parametric nonlinear discrete optimization over well-described sets and matroid intersections. Math. Program. 124, 233\u2013253 (2010)","journal-title":"Math. Program."},{"key":"545_CR3","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P. Bonami","year":"2008","unstructured":"Bonami P., Biegler L.T., Conn A.R., Cornu\u00e9jols G., Grossmann I.E., Laird C.D., Lee J., Lodi A., Margot F., Sawaya N., W\u00e4chter A.: An algorithmic framework for convex mixed-integer nonlinear programs. Discret. Optim. 5, 186\u2013204 (2008)","journal-title":"Discret. Optim."},{"key":"545_CR4","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M.A. Duran","year":"1986","unstructured":"Duran M.A., Grossmann I.E.: An outer approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307\u2013339 (1986)","journal-title":"Math. Program."},{"issue":"3","key":"545_CR5","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R. Fletcher","year":"1994","unstructured":"Fletcher R., Leyffer S.: Solving mixed-integer nonlinear programs by outer-approximation. Math. Program. 66(3), 327\u2013349 (1994)","journal-title":"Math. Program."},{"issue":"4","key":"545_CR6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A.M. Geoffrion","year":"1972","unstructured":"Geoffrion A.M.: Generalized benders decomposition. J. Optim. Theory Appl. 10(4), 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"key":"545_CR7","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/j.jco.2005.04.004","volume":"21","author":"S. Heinz","year":"2005","unstructured":"Heinz S.: Complexity of integer quasiconvex polynomial optimization. J. Complex. 21, 543\u2013556 (2005)","journal-title":"J. Complex."},{"issue":"2","key":"545_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.disopt.2006.06.006","volume":"5","author":"R. Hemmecke","year":"2008","unstructured":"Hemmecke R., De Loera J., Onn S., Weismantel R.: N-fold integer programming. Discret. Optim. 5(2), 231\u2013241 (2008)","journal-title":"Discret. Optim."},{"key":"545_CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10107-009-0276-7","volume":"126","author":"R. Hemmecke","year":"2011","unstructured":"Hemmecke R., Onn S., Weismantel R.: A polynomial oracle-time algorithm for convex integer minimization. Math. Program. 126, 97\u2013117 (2011)","journal-title":"Math. Program."},{"key":"545_CR10","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"Kelley J.E.: The cutting plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8, 703\u2013712 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"545_CR11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/PL00009496","volume":"23","author":"L.G. Khachiyan","year":"2000","unstructured":"Khachiyan L.G., Porkolab L.: Integer optimization on convex semialgebraic sets. Discret. Comput. Geom. 23, 207\u2013224 (2000)","journal-title":"Discret. Comput. Geom."},{"key":"545_CR12","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1137\/080718103","volume":"23","author":"J. Lee","year":"2009","unstructured":"Lee J., Onn S., Weismantel R.: Approximate nonlinear optimization over weighted independence systems. SIAM J. Discret. Math. 23, 1667\u20131681 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"545_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Y. Nesterov","year":"2004","unstructured":"Nesterov Y.: Introductory Lectures on Convex Optimization. Kluwer, Dordrecht (2004)"},{"key":"545_CR14","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"R.A. Stubbs","year":"1999","unstructured":"Stubbs R.A., Mehrotra S.: A branch-and-cut method for 0\u20131 convex programming. Math. Program. 86, 515\u2013532 (1999)","journal-title":"Math. Program."},{"key":"545_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"19","author":"T. Westerlund","year":"1995","unstructured":"Westerlund T., Petterson F.: An extended cutting plane method for solving convex MINLP problems. Comput. Chem. Eng. 19, 131\u2013136 (1995)","journal-title":"Comput. Chem. Eng."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0545-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0545-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0545-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:59:59Z","timestamp":1559109599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0545-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,24]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["545"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0545-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,24]]}}}