{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T05:40:07Z","timestamp":1742017207793,"version":"3.38.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T00:00:00Z","timestamp":1718150400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T00:00:00Z","timestamp":1718150400000},"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":["Optim Lett"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s11590-024-02127-8","type":"journal-article","created":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T07:01:41Z","timestamp":1718175701000},"page":"463-504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solution polishing via path relinking for continuous black-box optimization"],"prefix":"10.1007","volume":"19","author":[{"given":"Dimitri J.","family":"Papageorgiou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kronqvist","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asha","family":"Ramanujam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Kor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youngdae","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Can","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,12]]},"reference":[{"issue":"4","key":"2127_CR1","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1287\/ijoc.1060.0189","volume":"19","author":"E Rothberg","year":"2007","unstructured":"Rothberg, E.: An evolutionary algorithm for polishing mixed integer programming solutions. INFORMS J. Comput. 19(4), 534\u2013541 (2007)","journal-title":"INFORMS J. Comput."},{"key":"2127_CR2","unstructured":"Gleixner, A., Eifler, L., Gally, T., Gamrath, G., Gemander, P., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., Miltenberger, M., et al.: The SCIP optimization suite 5.0 (2017)"},{"key":"2127_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. SIAM, Philadelphia, PA (2009)"},{"key":"2127_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0962492919000060","volume":"28","author":"J Larson","year":"2019","unstructured":"Larson, J., Menickelly, M., Wild, S.M.: Derivative-free optimization methods. Acta Numer. 28, 287\u2013404 (2019)","journal-title":"Acta Numer."},{"issue":"3","key":"2127_CR5","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"Rios, L.M., Sahinidis, N.V.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Glob. Optim. 56(3), 1247\u20131293 (2013)","journal-title":"J. Glob. Optim."},{"key":"2127_CR6","first-page":"13","volume":"1363","author":"F Glover","year":"1998","unstructured":"Glover, F.: A template for scatter search and path relinking. Artificial Evolution. Lecture Notes in Computer Science 1363, 13\u201354 (1998)","journal-title":"Lecture Notes in Computer Science"},{"issue":"2","key":"2127_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.ejor.2009.03.035","volume":"201","author":"P-Y Yin","year":"2010","unstructured":"Yin, P.-Y., Glover, F., Laguna, M., Zhu, J.-X.: Cyber swarm algorithms-improving particle swarm optimization using adaptive memory strategies. Eur. J. Oper. Res. 201(2), 377\u2013389 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2127_CR8","first-page":"653","volume":"29","author":"F Glover","year":"2000","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Fundamentals of scatter search and path relinking. Control Cybern. 29(3), 653\u2013684 (2000)","journal-title":"Control Cybern."},{"key":"2127_CR9","unstructured":"Laguna, M., Mart\u00ed, R., Martinez-Gavara, A., Perez-Pel\u00f3, S., Resende, M.G.C.: 20 years of Greedy Randomized Adaptive Search Procedures with Path Relinking (2023)"},{"key":"2127_CR10","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1007\/s00500-010-0650-7","volume":"15","author":"A Duarte","year":"2011","unstructured":"Duarte, A., Mart\u00ed, R., Gortazar, F.: Path relinking for large-scale global optimization. Soft Comput. 15, 2257\u20132273 (2011)","journal-title":"Soft Comput."},{"key":"2127_CR11","doi-asserted-by":"crossref","unstructured":"Papageorgiou, D.J., Kronqvist, J., Kumaran, K.: Linewalker: Line search for black box derivative-free optimization and surrogate model construction. Optim. Eng. (2024)","DOI":"10.1007\/s11081-023-09879-9"},{"key":"2127_CR12","unstructured":"Brochu, E., Cora, V.M., De\u00a0Freitas, N.: A tutorial on Bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning. arXiv preprint arXiv:1012.2599 (2010)"},{"issue":"1","key":"2127_CR13","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/JPROC.2015.2494218","volume":"104","author":"B Shahriari","year":"2015","unstructured":"Shahriari, B., Swersky, K., Wang, Z., Adams, R.P., De Freitas, N.: Taking the human out of the loop: a review of Bayesian optimization. Proc. IEEE 104(1), 148\u2013175 (2015)","journal-title":"Proc. IEEE"},{"key":"2127_CR14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point Polynomial Algorithms in Convex Programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia, PA (1994)"},{"issue":"4","key":"2127_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1916461.1916468","volume":"37","author":"S Le Digabel","year":"2011","unstructured":"Le Digabel, S.: Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm. ACM Trans. Math. Softw. 37(4), 1\u201315 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"2127_CR16","doi-asserted-by":"crossref","unstructured":"Ploskas, N., Sahinidis, N.V.: Review and comparison of algorithms and software for mixed-integer derivative-free optimization. J. Glob. Optim. 1\u201330 (2021)","DOI":"10.1007\/s10898-021-01085-0"},{"key":"2127_CR17","unstructured":"Vanaret, C., Gotteland, J.-B., Durand, N., Alliot, J.-M.: Certified global minima for a benchmark of difficult optimization problems. arXiv preprint arXiv:2003.09867 (2020)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02127-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02127-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02127-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T05:11:08Z","timestamp":1742015468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02127-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,12]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2127"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02127-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2024,6,12]]},"assertion":[{"value":"16 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}