{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:39:59Z","timestamp":1759847999470},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,6,4]],"date-time":"2015-06-04T00:00:00Z","timestamp":1433376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10107-015-0918-x","type":"journal-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T12:26:31Z","timestamp":1433334391000},"page":"143-173","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An efficient global algorithm for a class of indefinite separable quadratic programs"],"prefix":"10.1007","volume":"158","author":[{"given":"Chanaka","family":"Edirisinghe","sequence":"first","affiliation":[]},{"given":"Jaehwan","family":"Jeong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,4]]},"reference":[{"key":"918_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/0471787779","volume-title":"Nonlinear Programming, Theory and Applications","author":"MS Bazaraa","year":"2006","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming, Theory and Applications, 3rd edn. Wiley, New York (2006)","edition":"3"},{"issue":"3","key":"918_CR2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/S0377-2217(01)00179-5","volume":"138","author":"KM Bretthauer","year":"2002","unstructured":"Bretthauer, K.M., Shetty, B.: The nonlinear knapsack problem-algorithms and applications. Eur. J. Oper. Res. 138(3), 459\u2013472 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"918_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s12532-011-0033-9","volume":"4","author":"J Chen","year":"2012","unstructured":"Chen, J., Burer, S.: Globally solving nonconvex quadratic programming problems via completely positive programming. Math. Programm. Comput. 4(1), 33\u201352 (2012)","journal-title":"Math. Programm. Comput."},{"issue":"3","key":"918_CR4","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10107-005-0595-2","volume":"106","author":"YH Dai","year":"2006","unstructured":"Dai, Y.H., Fletcher, R.: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math. Programm. 106(3), 403\u2013421 (2006)","journal-title":"Math. Programm."},{"key":"918_CR5","doi-asserted-by":"crossref","unstructured":"Du, D.Z., Pardalos, P.M.: Handbook of Combinatorial Optimization, vol. 3. Springer, New York (1998)","DOI":"10.1007\/978-1-4613-0303-9"},{"issue":"3","key":"918_CR6","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/BF01588328","volume":"18","author":"R Helgason","year":"1980","unstructured":"Helgason, R., Kennington, J.L., Lall, H.: A polynomially bounded algorithm for a singly constrained quadratic program. Math. Programm. 18(3), 338\u2013343 (1980)","journal-title":"Math. Programm."},{"key":"918_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0015-5","volume-title":"Introduction to Global Optimization","author":"R Horst","year":"2000","unstructured":"Horst, R., Pardalos, P.M., Van Thoai, N.: Introduction to Global Optimization. Kluwer Academic Pub, Dordrecht (2000)"},{"key":"918_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, New York (2004)"},{"key":"918_CR9","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10107-006-0050-z","volume":"112","author":"K Kiwiel","year":"2008","unstructured":"Kiwiel, K.: Breakpoint searching algorithms for the continuous quadratic knapsack problem. Math. Programm. 112, 473\u2013491 (2008)","journal-title":"Math. Programm."},{"issue":"1","key":"918_CR10","first-page":"397","volume":"49","author":"JJ Mor\u00e9","year":"1991","unstructured":"Mor\u00e9, J.J., Vavasis, S.A.: On the solution of concave knapsack problems. Mathe. programm. 49(1), 397\u2013411 (1991)","journal-title":"Mathe. programm."},{"issue":"4","key":"918_CR11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02239972","volume":"39","author":"PM Pardalos","year":"1987","unstructured":"Pardalos, P.M., Glick, J.H., Rosen, J.B.: Global minimization of indefinite quadratic problems. Computing 39(4), 281\u2013291 (1987)","journal-title":"Computing"},{"issue":"3","key":"918_CR12","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01585748","volume":"46","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P.M., Kovoor, N.: An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds. Math. Programm. 46(3), 321\u2013328 (1990)","journal-title":"Math. Programm."},{"key":"918_CR13","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. Glob. Optim. 1, 15\u201323 (1991)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"918_CR14","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(4), 262\u2013279 (1974)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"918_CR15","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581085","volume":"57","author":"SA Vavasis","year":"1992","unstructured":"Vavasis, S.A.: Approximation algorithms for indefinite quadratic programming. Math. Programm. 57(2), 279\u2013311 (1992)","journal-title":"Math. Programm."},{"issue":"2","key":"918_CR16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01586048","volume":"54","author":"SA Vavasis","year":"1992","unstructured":"Vavasis, S.A.: Local minima for indefinite quadratic knapsack-problems. Math. Programm. 54(2), 127\u2013153 (1992)","journal-title":"Math. Programm."},{"key":"918_CR17","doi-asserted-by":"crossref","first-page":"3159","DOI":"10.1007\/978-0-387-74759-0_537","volume-title":"Encyclopedia of Optimization","author":"Y Yajima","year":"2009","unstructured":"Yajima, Y.: Quadratic knapsack. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, 2nd edn, pp. 3159\u20133161. Springer, New York (2009)","edition":"2"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0918-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0918-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0918-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T01:31:26Z","timestamp":1566783086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0918-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,4]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["918"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0918-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,4]]}}}