{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:16Z","timestamp":1759637836112},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2013,12,17]],"date-time":"2013-12-17T00:00:00Z","timestamp":1387238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10898-013-0126-2","type":"journal-article","created":{"date-parts":[[2013,12,16]],"date-time":"2013-12-16T08:52:04Z","timestamp":1387183924000},"page":"243-258","source":"Crossref","is-referenced-by-count":12,"title":["Rounding on the standard simplex: regular grids for global optimization"],"prefix":"10.1007","volume":"59","author":[{"given":"Immanuel M.","family":"Bomze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Gollowitzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. Alper","family":"Y\u0131ld\u0131r\u0131m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,17]]},"reference":[{"key":"126_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)"},{"key":"126_CR2","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of combinatorial Optimization (supp. Vol. A), pp. 1\u201374. Kluwer, Dordrecht (1999)","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"126_CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., de Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Glob. Optim. 24, 163\u2013185 (2002)","journal-title":"J. Glob. Optim."},{"key":"126_CR4","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/s10898-010-9524-x","volume":"50","author":"LG Casado","year":"2011","unstructured":"Casado, L.G., Garc\u00eda, I., T\u00f3th, B.G., Hendrix, E.M.: On determining the cover of a simplex by spheres centered at its vertices. J. Global Optim. 50, 645\u2013655 (2011)","journal-title":"J. Global Optim."},{"key":"126_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01582230","volume":"34","author":"W Cook","year":"1986","unstructured":"Cook, W., Gerards, A.M.H., Schrijver, A., Tardos, \u00c9.: Sensitivity theorems in integer linear programming. Math. Program. 34, 251\u2013264 (1986)","journal-title":"Math. Program."},{"key":"126_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10100-007-0052-9","volume":"16","author":"E Klerk de","year":"2008","unstructured":"de Klerk, E.: The complexity of optimizing over a simplex, hypercube or sphere: a short survey. Cent. Eur. J. Oper. Res. 16, 111\u2013125 (2008)","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"126_CR7","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.ejor.2007.01.055","volume":"191","author":"E Klerk de","year":"2008","unstructured":"de Klerk, E.: D. den Hertog, and G. Elabwabi: On the complexity of optimization over the standard simplex. Eur. J. Oper. Res. 191, 773\u2013785 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"126_CR8","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.tcs.2006.05.011","volume":"361","author":"E Klerk de","year":"2006","unstructured":"de Klerk, E., Laurent, M., Parrilo, P.: A PTAS for the minimization of polynomials of fixed degree over the simplex. Theor. Comp. Sci. 361, 210\u2013225 (2006)","journal-title":"Theor. Comp. Sci."},{"key":"126_CR9","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0041-5553(71)90065-6","volume":"11","author":"Y Evtushenko","year":"1971","unstructured":"Evtushenko, Y.: Numerical methods for finding global extreme (case of a non-uniform mesh). USSR Comput. Math. Math. Phys. 11, 38\u201354 (1971)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"126_CR10","doi-asserted-by":"crossref","unstructured":"Faybusovich, L.: Global optimization of homogeneous polynomials on the simplex and on the sphere. In: Floudas, C., Pardalos, P. (eds.) Frontiers in global optimization, pp. 109\u2013121. Kluwer, Dordrecht (2003)","DOI":"10.1007\/978-1-4613-0251-3_6"},{"key":"126_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Berlin (1996)"},{"key":"126_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-3984-4","volume-title":"Approximation methods for polynomial optimization: Models, algorithms and applications","author":"Z Li","year":"2012","unstructured":"Li, Z., He, S., Zhang, S.: Approximation methods for polynomial optimization: Models, algorithms and applications. Springer Briefs in Optimization, New York (2012)"},{"key":"126_CR13","volume-title":"Problem complexity and method efficiency in optimization","author":"AS Nemirovsky","year":"1983","unstructured":"Nemirovsky, A.S., Yudin, D.B.: Problem complexity and method efficiency in optimization. Wiley-Interscience, New York (1983)"},{"key":"126_CR14","volume-title":"Simplicial Global Optimization","author":"R Paulavi\u010dius","year":"2013","unstructured":"Paulavi\u010dius, R., \u017dilinskas, J.: Simplicial Global Optimization. Springer, New York (2013)"},{"key":"126_CR15","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1023\/A:1008377529330","volume":"13","author":"U Raber","year":"1998","unstructured":"Raber, U.: A simplicial branch-and-bound method for solving nonconvex all-quadratic programs. J. Glob. Optim. 13, 417\u2013432 (1998)","journal-title":"J. Glob. Optim."},{"key":"126_CR16","volume-title":"Wiley Encyclopedia of Operations Research and Management Science","author":"YD Sergeyev","year":"2010","unstructured":"Sergeyev, Y.D., Kvasov, D.E.: Lipschitz global optimization. In: Cochran, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.) Wiley Encyclopedia of Operations Research and Management Science. Wiley, New York (2010)"},{"key":"126_CR17","volume-title":"Minimax Algorithms in Problems of Numerical Analysis (in Russian)","author":"AG Sukharev","year":"1989","unstructured":"Sukharev, A.G.: Minimax Algorithms in Problems of Numerical Analysis (in Russian). Nauka, Moscow (1989)"},{"key":"126_CR18","volume-title":"Infomation-Based Complexity","author":"JF Traub","year":"1988","unstructured":"Traub, J.F., Wasilkowski, G.W., Wozniakowski, H.: Infomation-Based Complexity. Academic Press, New York (1988)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0126-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-013-0126-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0126-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T23:36:44Z","timestamp":1564961804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-013-0126-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,17]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["126"],"URL":"https:\/\/doi.org\/10.1007\/s10898-013-0126-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,17]]}}}