{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T23:06:26Z","timestamp":1764371186243,"version":"3.46.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T00:00:00Z","timestamp":1759449600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T00:00:00Z","timestamp":1759449600000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10589-025-00738-0","type":"journal-article","created":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T10:04:17Z","timestamp":1759485857000},"page":"755-760","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Preface: global optimization algorithms and applications"],"prefix":"10.1007","volume":"92","author":[{"given":"Vladimir","family":"Boginski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alla","family":"Kammerdiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavlo","family":"Krokhmal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Semenov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,3]]},"reference":[{"key":"738_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-025-00715-7","author":"F Cengil","year":"2025","unstructured":"Cengil, F., Nagarajan, H., Bent, R., Eksioglu, S., Eksioglu, B.: Learning to accelerate tightening of convex relaxations of the ac optimal power flow problem. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00715-7","journal-title":"Comput. Optim. Appl."},{"key":"738_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00624-1","author":"A Fan","year":"2024","unstructured":"Fan, A., Huang, Z., Zheng, Q., Luo, X.: A two-stage stochastic programming approach for generation and transmission maintenance scheduling with risk management. Comput. Optim. Appl. (2024). https:\/\/doi.org\/10.1007\/s10589-024-00624-1","journal-title":"Comput. Optim. Appl."},{"key":"738_CR3","doi-asserted-by":"publisher","unstructured":"Gribanov D.V., Malyshev D.S., Pardalos P.M., Zolotykh N.Y.: A new and faster representation for counting integer points in parametric polyhedra. Computational Optimization and Applications, (2024). https:\/\/doi.org\/10.1007\/s10589-024-00632-1","DOI":"10.1007\/s10589-024-00632-1"},{"key":"738_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-025-00673-0","author":"A Li","year":"2025","unstructured":"Li, A., Peng, J., Fan, L.: New biconvex optimization for planning of battery energy storage systems. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00673-0","journal-title":"Comput. Optim. Appl."},{"key":"738_CR5","doi-asserted-by":"publisher","unstructured":"Ma, K., Rios, L.M., Zheng, H., Sahinidis, N.V., Rajagopalan, S.: Model-and-search: a derivative-free local optimization algorithm. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00686-9","DOI":"10.1007\/s10589-025-00686-9"},{"key":"738_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-025-00674-z","author":"M Makovenko","year":"2025","unstructured":"Makovenko, M., Butenko, S., Pardalos, M.: Regularized standard polynomial programming formulations for the maximum clique problem. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00674-z","journal-title":"Comput. Optim. Appl."},{"key":"738_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-025-00733-5","author":"M Norton","year":"2025","unstructured":"Norton, M., Chiang, L., Uryasev, S.: Error control and neyman-pearson classification with buffered probability and support vectors. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00733-5","journal-title":"Comput. Optim. Appl."},{"key":"738_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-025-00660-5","author":"Konstantin Pavlikov and Niels Christian Petersen","year":"2025","unstructured":"Konstantin Pavlikov and Niels Christian Petersen: Two-commodity opposite direction network flow formulations for the travelling salesman problem. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00660-5","journal-title":"Comput. Optim. Appl."},{"key":"738_CR9","doi-asserted-by":"publisher","unstructured":"Turan, E.M., J\u00e4schke, J., Kannan, R.: Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00710-y","DOI":"10.1007\/s10589-025-00710-y"},{"key":"738_CR10","doi-asserted-by":"publisher","unstructured":"Veremyev, A., Boginski, V., Pasiliao, E.L., Prokopyev, O.A.: Ultra-small world detection in networks: subgraphs with prescribed distance distributions. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-024-00640-1","DOI":"10.1007\/s10589-024-00640-1"},{"key":"738_CR11","doi-asserted-by":"publisher","unstructured":"Zhang, Y., Sahinidis, N.V.: Solving continuous and discrete nonlinear programs with BARON. Comput. Optim. Appl. (2024). https:\/\/doi.org\/10.1007\/s10589-024-00633-0","DOI":"10.1007\/s10589-024-00633-0"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00738-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00738-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00738-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T23:01:48Z","timestamp":1764370908000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00738-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,3]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["738"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00738-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2025,10,3]]},"assertion":[{"value":"3 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}