{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T07:26:54Z","timestamp":1781249214857,"version":"3.54.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"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":["Optim Lett"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s11590-024-02149-2","type":"journal-article","created":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T13:02:15Z","timestamp":1727787735000},"page":"527-549","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved Branch and Bound algorithm and an interpolation-based search algorithm for quadratic minimization with one negative eigenvalue"],"prefix":"10.1007","volume":"19","author":[{"given":"M.","family":"Salahi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Ansary Karbasy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T. A.","family":"Almaadeed","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Hamdi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,10,1]]},"reference":[{"key":"2149_CR1","unstructured":"https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio. Accessed 24 July, 2019"},{"key":"2149_CR2","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10107-009-0287-4","volume":"126","author":"V Goyal","year":"2011","unstructured":"Goyal, V., Genc-Kaya, L., Ravi, R.: An FPTAS for minimizing the product of two non-negative linear cost functions. Math. Program. 126, 401\u2013405 (2011)","journal-title":"Math. Program."},{"key":"2149_CR3","doi-asserted-by":"publisher","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)"},{"issue":"1","key":"2149_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-018-0142-9","volume":"11","author":"H Luo","year":"2019","unstructured":"Luo, H., Bai, X., Lim, G., Peng, J.: New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation. Math. Program. Comput. 11(1), 119\u2013171 (2019)","journal-title":"Math. Program. Comput."},{"key":"2149_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00121658","volume":"9","author":"T Matsui","year":"1996","unstructured":"Matsui, T.: NP-hardness of linear multiplicative programming and related problems. J. Glob. Optim. 9, 113\u2013119 (1996)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"2149_CR6","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1007\/s11590-020-01653-5","volume":"15","author":"I Minarchenko","year":"2021","unstructured":"Minarchenko, I., Khamisov, O.: On minimization of a quadratic function with one negative eigenvalue. Opt. Lett. 15(4), 1447\u20131455 (2021)","journal-title":"Opt. Lett."},{"key":"2149_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0000035","volume-title":"Constrained Global Optimization: Algorithms and Applications","author":"PM Pardalos","year":"1987","unstructured":"Pardalos, P.M., Rosen, J.B.: Constrained Global Optimization: Algorithms and Applications. Springer, Berlin (1987)"},{"key":"2149_CR8","doi-asserted-by":"publisher","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\u201322 (1991)","journal-title":"J. Glob. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02149-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02149-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02149-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T05:11:15Z","timestamp":1742015475000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02149-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,1]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2149"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02149-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,1]]},"assertion":[{"value":"19 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors of this paper declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}