{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T20:10:02Z","timestamp":1737231002716,"version":"3.33.0"},"reference-count":29,"publisher":"Informa UK Limited","issue":"4-5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2005,8]]},"DOI":"10.1080\/10556780500139872","type":"journal-article","created":{"date-parts":[[2007,7,8]],"date-time":"2007-07-08T01:26:08Z","timestamp":1183857968000},"page":"525-544","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of general continuous minimization problems: a survey"],"prefix":"10.1080","volume":"20","author":[{"given":"M.","family":"Gaviano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Lera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"volume-title":"The Design and Analysis of Computer Algorithms","year":"1974","author":"Aho A. V.","key":"CIT0001"},{"key":"CIT0002","first-page":"429","volume-title":"Complexity in Numerical Optimization (World Scientific) 1993. Also in Journal of Mathematical Programming B","volume":"69","author":"Bellare M.","year":"1995"},{"key":"CIT0003","first-page":"261","volume":"10","author":"Borotas Z.","year":"2002","journal-title":"CEJOR"},{"volume-title":"Network Optimization problems: Algorithms, Complexity and Applications","year":"1993","author":"DingZhu Du","key":"CIT0004"},{"volume-title":"Towards Global Optimization","year":"1975","author":"Dixon L. C.","key":"CIT0005"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1080\/10556780290027783"},{"volume-title":"Optimization","year":"1991","author":"Goldfarb D.","key":"CIT0007"},{"volume-title":"Introduction to Global Optimization","year":"1995","author":"Horst R.","key":"CIT0008"},{"key":"CIT0009","doi-asserted-by":"crossref","unstructured":"Karmarkar, N. A new polynomial time algorithm for linear programming. Proceedings of the 16th Annuual ACM Symposium on the Theory of Computing. pp.302\u2013311.","DOI":"10.1145\/800057.808695"},{"key":"CIT0010","first-page":"1093","volume":"244","author":"Khachian L. G.","year":"1979","journal-title":"Doklady Akademiia Nauk SSSR"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013811230753"},{"volume-title":"Problem Complexity and Method Efficiency in Optimization","year":"1983","author":"Nemirovsky A. S.","key":"CIT0012"},{"key":"CIT0013","volume":"23","author":"Nesterov Y.","year":"1994","journal-title":"SIAM Studies in applied Mathematics"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1142\/9789814354363"},{"key":"CIT0015","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3145-3","volume-title":"Approximation and Complexity in Numerical Optimization","author":"Pardalos P. M.","year":"2000"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582296"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022612511618"},{"volume-title":"Information-Based Complexity","year":"1988","author":"Traub J. F.","key":"CIT0018"},{"volume-title":"Complexity and Information","year":"1998","author":"Traub J. F.","key":"CIT0019"},{"volume-title":"Nonlinear Optimization: Complexity Issues","year":"1991","author":"Vavasis S. A.","key":"CIT0020"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1137\/0803004"},{"key":"CIT0022","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-1-4615-2025-2_2","volume-title":"Handbook of Global Optimization","author":"Vavasis S. A.","year":"1995"},{"key":"CIT0023","unstructured":"Wolpert, D. H. and Macready, W. G. 1995. \u201cNo Free Lunch theorems for search\u201d. Santa Fe, NM, USA: Santa Fe Institute. Technical Report SFI-TR-05-010"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011410"},{"key":"CIT0026","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"Wright S. J.","year":"1997"},{"volume-title":"Interior Point Algorithms, Theory and Analysis","year":"1997","author":"Yinyu Ye","key":"CIT0027"},{"key":"CIT0028","first-page":"357","volume-title":"Ekonomika i Matematicheskie Metody","volume":"12","author":"Yudin D. B.","year":"1976"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585710"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556780500139872","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T19:31:14Z","timestamp":1737228674000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/10556780500139872"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8]]},"references-count":29,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2005,8]]}},"alternative-id":["10.1080\/10556780500139872"],"URL":"https:\/\/doi.org\/10.1080\/10556780500139872","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2005,8]]}}}