{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T10:11:03Z","timestamp":1755598263308},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319334608"},{"type":"electronic","value":"9783319334615"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-33461-5_1","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T18:35:59Z","timestamp":1464114959000},"page":"1-13","source":"Crossref","is-referenced-by-count":4,"title":["On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Del Pia","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,25]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: The complexity of aproximating a nonlinear program. In: Pardalos, P.M. (ed.), Complexity in Numerical Optimization. World Scientific (1993)","DOI":"10.1142\/9789814354363_0002"},{"key":"1_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer, Heidelberg (2014)"},{"issue":"1","key":"1_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01191202","volume":"12","author":"W Cook","year":"1992","unstructured":"Cook, W., Hartman, M., Kannan, R., McDiarmid, C.: On integer points in polyhedra. Combinatorica 12(1), 27\u201337 (1992)","journal-title":"Combinatorica"},{"issue":"1\u20133","key":"1_CR4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"WJ Cook","year":"1990","unstructured":"Cook, W.J., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programming problems. Math. Program. 47(1\u20133), 155\u2013174 (1990)","journal-title":"Math. Program."},{"key":"1_CR5","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.: A PTAS for the minimization of polynomials of fixed degree over the simplex. Theoret. Comput. Sci. 361, 210\u2013225 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Del Pia, A., Dey, S.S., Molinaro, M.: Mixed-integer quadratic programming is in NP, Manuscript (2014)","DOI":"10.1137\/1.9781611973402.62"},{"key":"1_CR7","series-title":"Nonconvex Optimization and its Applications","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/978-1-4615-2025-2_5","volume-title":"Handbook of Global Optimization","author":"CA Floudas","year":"1995","unstructured":"Floudas, C.A., Visweswaran, V.: Quadratic optimization. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization. Nonconvex Optimization and its Applications, vol. 2, pp. 217\u2013269. Springer, New York (1995)"},{"key":"1_CR8","unstructured":"Freund, R.M., Roundy, R., Todd, M.J.: Identifying the set of always-active constraints in a system of linear inequalities by a single linear program. Working Paper, pp. 1674\u201385, Sloan School of Management, MIT, Cambridge, MA (1985)"},{"key":"1_CR9","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore, MD, USA (1996)","edition":"3"},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/j.jco.2005.04.004","volume":"21","author":"S Heinz","year":"2005","unstructured":"Heinz, S.: Complexity of integer quasiconvex polynomial optimization. J. Complex. 21, 543\u2013556 (2005)","journal-title":"J. Complex."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.disopt.2012.11.003","volume":"10","author":"R Hildebrand","year":"2013","unstructured":"Hildebrand, R., K\u00f6ppe, M.: A new lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity $$2^{O(n \\log n)}$$ . Discrete Optim. 10, 69\u201384 (2013)","journal-title":"Discrete Optim."},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.orl.2015.03.002","volume":"43","author":"R Hildebrand","year":"2015","unstructured":"Hildebrand, R., Oertel, T., Weismantel, R.: Note on the complexity of the mixed-integer hull of a polyhedron. Oper. Res. Lett. 43, 279\u2013282 (2015)","journal-title":"Oper. Res. Lett."},{"key":"1_CR13","unstructured":"Khachiyan, L.G.: A polynomial algorithm in linear programming (in Russian). Doklady Akademii Nauk SSSR, 244, pp. 1093\u20131096 (1979). (English translation: Soviet Mathematics Doklady, 20, pp. 191\u2013194, 1979)"},{"issue":"4","key":"1_CR14","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1_CR15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01585518","volume":"7","author":"RR Meyer","year":"1974","unstructured":"Meyer, R.R.: On the existence of optimal solutions to integer and mixed-integer programming problems. Math. Program. 7(1), 223\u2013235 (1974)","journal-title":"Math. Program."},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty, K.G., Kabadi, S.N.: Some NP-complete problems in quadratic and linear programming. Math. Program. 39, 117\u2013129 (1987)","journal-title":"Math. Program."},{"key":"1_CR17","unstructured":"Nemirovsky, A.S., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. Wiley, Chichester (1983). Translated by E.R. Dawson from Slozhnost\u2019 Zadach i Effektivnost\u2019 Metodov Optimizatsii (1979)"},{"key":"1_CR18","unstructured":"Onn, S.: Convex discrete optimization. In: Chv\u00e1tal, V. (ed.) Combinatorial Optimization: Observation of Strains. Infect Dis Ther. Methods Appl. 3(1), 35\u201343, pp. 183\u2013228. IOS Press (2011)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Rosen, J.B. (eds.): Constrained Global Optimization: Algorithms and Applications. LNCS, vol. 268. Springer, Heidelberg (1987)","DOI":"10.1007\/BFb0000035"},{"issue":"1","key":"1_CR20","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"PM Pardalos","year":"1991","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP-hard. J. Global Optim. 1(1), 15\u201322 (1991)","journal-title":"J. Global Optim."},{"key":"1_CR21","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01580581","volume":"34","author":"JB Rosen","year":"1986","unstructured":"Rosen, J.B., Pardalos, P.M.: Global minimization of large-scale constrained concave quadratic problems by separable programming. Math. Program. 34, 163\u2013174 (1986)","journal-title":"Math. Program."},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S Sahni","year":"1974","unstructured":"Sahni, S.: Computationally related problems. SIAM J. Comput. 3, 262\u2013279 (1974)","journal-title":"SIAM J. Comput."},{"key":"1_CR23","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"key":"1_CR24","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0190(90)90100-C","volume":"36","author":"SA Vavasis","year":"1990","unstructured":"Vavasis, S.A.: Quadratic programming is in NP. Inform. Proces. Lett. 36, 73\u201377 (1990)","journal-title":"Inform. Proces. Lett."},{"key":"1_CR25","first-page":"3","volume-title":"Recent Advances in Global Optimization","author":"SA Vavasis","year":"1992","unstructured":"Vavasis, S.A.: On approximation algorithms for concave quadratic programming. In: Floudas, C.A., Pardalos, P.M. (eds.) Recent Advances in Global Optimization, pp. 3\u201318. Princeton University Press, Princeton (1992)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33461-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T15:46:11Z","timestamp":1567957571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33461-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319334608","9783319334615"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33461-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}