{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T00:23:19Z","timestamp":1770510199661,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,5,4]],"date-time":"2017-05-04T00:00:00Z","timestamp":1493856000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Suomen Akatemia","doi-asserted-by":"publisher","award":["289500"],"award-info":[{"award-number":["289500"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10898-017-0528-7","type":"journal-article","created":{"date-parts":[[2017,5,4]],"date-time":"2017-05-04T08:31:01Z","timestamp":1493886661000},"page":"443-459","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5122-5491","authenticated-orcid":false,"given":"Ville-Pekka","family":"Eronen","sequence":"first","affiliation":[]},{"given":"Jan","family":"Kronqvist","sequence":"additional","affiliation":[]},{"given":"Tapio","family":"Westerlund","sequence":"additional","affiliation":[]},{"given":"Marko M.","family":"M\u00e4kel\u00e4","sequence":"additional","affiliation":[]},{"given":"Napsu","family":"Karmitsa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,4]]},"reference":[{"key":"528_CR1","first-page":"5","volume":"10","author":"T Arnold","year":"2014","unstructured":"Arnold, T., Henrion, R., Moller, A., Vigerske, S.: A mixed-integer stochastic nonlinear optimization problem with joint probabilistic constraints. Pac. J. Optim. 10, 5\u201320 (2014)","journal-title":"Pac. J. Optim."},{"key":"528_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-08114-4","volume-title":"Introduction to Nonsmooth Optimization: Theory, Practice and Software","author":"A Bagirov","year":"2014","unstructured":"Bagirov, A., M\u00e4kel\u00e4, M.M., Karmitsa, N.: Introduction to Nonsmooth Optimization: Theory, Practice and Software. Springer, Cham (2014)"},{"key":"528_CR3","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10107-008-0212-2","volume":"119","author":"P Bonami","year":"2009","unstructured":"Bonami, P., Cournu\u00e9jols, G., Lodi, A., Margot, F.: A feasibility pump for mixed integer nonlinear programs. Math. Program. 119, 331\u2013352 (2009)","journal-title":"Math. Program."},{"key":"528_CR4","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.compchemeng.2005.07.012","volume":"30","author":"I Castillo","year":"2005","unstructured":"Castillo, I., Westerlund, J., Emet, S., Westerlund, T.: Optimization of block layout design problems with unequal areas: a comparison of MILP and MINLP optimization methods. Comput. Chem. Eng. 30, 54\u201369 (2005)","journal-title":"Comput. Chem. Eng."},{"key":"528_CR5","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley-Interscience, New York (1983)"},{"key":"528_CR6","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/s11750-016-0413-4","volume":"24","author":"W Oliveira de","year":"2016","unstructured":"de Oliveira, W.: Regularized optimization methods for convex MINLP problems. TOP 24, 665\u2013692 (2016)","journal-title":"TOP"},{"key":"528_CR7","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1016\/j.compchemeng.2004.02.010","volume":"28","author":"S Emet","year":"2004","unstructured":"Emet, S., Westerlund, T.: Comparisons of solving a chromatographic separation problem using MINLP methods. Comput. Chem. Eng. 28, 673\u2013682 (2004)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"528_CR8","first-page":"641","volume":"64","author":"V-P Eronen","year":"2015","unstructured":"Eronen, V.-P., M\u00e4kel\u00e4, M.M., Westerlund, T.: Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems. Optimization 64(3), 641\u2013661 (2015)","journal-title":"Optimization"},{"key":"528_CR9","doi-asserted-by":"crossref","unstructured":"Kronqvist, J., Lundell, A., Westerlund, T.: The ESH algorithm for convex mixed-integer nonlinear programming. J. Glob. Optim. 64(2), 249\u2013272 (2016)","DOI":"10.1007\/s10898-015-0322-3"},{"key":"528_CR10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0167-6377(98)00024-8","volume":"23","author":"RD Meller","year":"1999","unstructured":"Meller, R.D., Narayanan, V., Vance, P.H.: Optimal facility layout design. Oper. Res. Lett. 23, 117\u2013127 (1999)","journal-title":"Oper. Res. Lett."},{"key":"528_CR11","doi-asserted-by":"crossref","unstructured":"P\u00f6rn, R.: Mixed-Integer Non-Linear Programming: Convexification Techniques and Algorithm Development. Ph.D. Thesis, \u00c5bo Akademi University (2000)","DOI":"10.1016\/S1570-7946(00)80002-4"},{"issue":"1","key":"528_CR12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1137\/0802008","volume":"2","author":"H Schramm","year":"1992","unstructured":"Schramm, H., Zowe, J.: A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results. SIAM J. Optim. 2(1), 121\u2013152 (1992)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"528_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1287\/opre.15.1.147","volume":"15","author":"AF Veinott Jr","year":"1967","unstructured":"Veinott Jr., A.F.: The supporting hyperplane method for unimodal programming. Oper. Res. 15(1), 147\u2013152 (1967)","journal-title":"Oper. Res."},{"key":"528_CR14","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1021091110342","volume":"3","author":"T Westerlund","year":"2002","unstructured":"Westerlund, T., P\u00f6rn, R.: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques. Optim. Eng. 3, 253\u2013280 (2002)","journal-title":"Optim. Eng."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0528-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0528-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0528-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T11:59:49Z","timestamp":1692791989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0528-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["528"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0528-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,4]]}}}