{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T22:40:48Z","timestamp":1779230448221,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T00:00:00Z","timestamp":1682985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T00:00:00Z","timestamp":1682985600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171151"],"award-info":[{"award-number":["12171151"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["T2293774"],"award-info":[{"award-number":["T2293774"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["E2ET0808X2"],"award-info":[{"award-number":["E2ET0808X2"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/moe","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["E2ET0808X2"],"award-info":[{"award-number":["E2ET0808X2"]}],"id":[{"id":"10.13039\/moe","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010031","name":"Postdoctoral Research Foundation of China","doi-asserted-by":"publisher","award":["2022M713102"],"award-info":[{"award-number":["2022M713102"]}],"id":[{"id":"10.13039\/501100010031","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010031","name":"Postdoctoral Research Foundation of China","doi-asserted-by":"publisher","award":["E2E49801"],"award-info":[{"award-number":["E2E49801"]}],"id":[{"id":"10.13039\/501100010031","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10589-023-00488-x","type":"journal-article","created":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T05:02:00Z","timestamp":1683003720000},"page":"241-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints"],"prefix":"10.1007","volume":"86","author":[{"given":"Shaoze","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0563-5841","authenticated-orcid":false,"given":"Zhibin","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Cheng","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Junhao","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Jinyu","family":"Dai","sequence":"additional","affiliation":[]},{"given":"Qiao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,2]]},"reference":[{"key":"488_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9","volume-title":"Handbook of Combinatorial Optimization","author":"D-Z Du","year":"1998","unstructured":"Du, D.-Z., Pardalos, P.M.: Handbook of Combinatorial Optimization, vol. 4. Springer, Boston (1998)"},{"key":"488_CR2","doi-asserted-by":"publisher","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, 2nd edn. Springer, New York (2000)","edition":"2"},{"key":"488_CR3","doi-asserted-by":"publisher","unstructured":"Pisinger, D., Toth, P.: Knapsack Problems. In: Du, D.Z., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization. pp. 299\u2013428. Springer, Boston, MA (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_5","DOI":"10.1007\/978-1-4613-0303-9_5"},{"issue":"1","key":"488_CR4","doi-asserted-by":"publisher","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. Program. 54(1), 127\u2013153 (1992)","journal-title":"Math. Program."},{"issue":"1","key":"488_CR5","doi-asserted-by":"publisher","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. Program. 46(1), 321\u2013328 (1990)","journal-title":"Math. Program."},{"issue":"3","key":"488_CR6","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10107-005-0595-2","volume":"106","author":"Y-H Dai","year":"2006","unstructured":"Dai, Y.-H., Fletcher, R.: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math. Program. 106(3), 403\u2013421 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"488_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s12532-014-0066-y","volume":"6","author":"R Cominetti","year":"2014","unstructured":"Cominetti, R., Mascarenhas, W.F., Silva, P.J.S.: A newton\u2019s method for the continuous quadratic knapsack problem. Math. Program. Comput. 6(1), 151\u2013169 (2014). https:\/\/doi.org\/10.1007\/s12532-014-0066-y","journal-title":"Math. Program. Comput."},{"key":"488_CR8","unstructured":"Jeong, J.: Indefinite knapsack separable quadratic programming: methods and applications. Ph.D thesis, University of Tennessee, Knoxville (2014)"},{"key":"488_CR9","doi-asserted-by":"crossref","unstructured":"De Marchi, A.: On a primal-dual newton proximal method for convex quadratic programs. Comput. Optim. Appl. 81(2), 369\u2013395 (2022)","DOI":"10.1007\/s10589-021-00342-y"},{"issue":"1","key":"488_CR10","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF01588800","volume":"49","author":"JJ Mor\u00e9","year":"1990","unstructured":"Mor\u00e9, J.J., Vavasis, S.A.: On the solution of concave knapsack problems. Math. Program. 49(1), 397\u2013411 (1990)","journal-title":"Math. Program."},{"issue":"1","key":"488_CR11","doi-asserted-by":"publisher","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. Program. 57(1), 279\u2013311 (1992)","journal-title":"Math. Program."},{"issue":"1","key":"488_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10107-016-1082-7","volume":"164","author":"C Edirisinghe","year":"2017","unstructured":"Edirisinghe, C., Jeong, J.: Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time. Math. Program. 164(1), 193\u2013227 (2017)","journal-title":"Math. Program."},{"issue":"1","key":"488_CR13","doi-asserted-by":"publisher","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. Program. Comput. 4(1), 33\u201352 (2012)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"488_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10107-015-0918-x","volume":"158","author":"C Edirisinghe","year":"2016","unstructured":"Edirisinghe, C., Jeong, J.: An efficient global algorithm for a class of indefinite separable quadratic programs. Math. Program. 158(1), 143\u2013173 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"488_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ejor.2019.04.004","volume":"278","author":"C Edirisinghe","year":"2019","unstructured":"Edirisinghe, C., Jeong, J.: Indefinite multi-constrained separable quadratic optimization: Large-scale efficient solution. Eur. J. Oper. Res. 278(1), 49\u201363 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"488_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10589-016-9855-8","volume":"66","author":"J Zhou","year":"2017","unstructured":"Zhou, J., Fang, S.-C., Xing, W.: Conic approximation to quadratic optimization with linear complementarity constraints. Comput. Optim. Appl. 66(1), 97\u2013122 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"488_CR17","doi-asserted-by":"publisher","unstructured":"Pardalos, P.M., Rosen, J.B.: Constrained Global Optimization: Algorithms and Applications. Springer, Berlin (1987). https:\/\/doi.org\/10.1007\/BFb0000035","DOI":"10.1007\/BFb0000035"},{"key":"488_CR18","doi-asserted-by":"crossref","unstructured":"Kamesam, P., Meyer, R.R.: Multipoint methods for separable nonlinear networks. In: Mathematical Programming at Oberwolfach II, pp. 185\u2013205. Springer, Berlin (1984)","DOI":"10.1007\/BFb0121016"},{"key":"488_CR19","doi-asserted-by":"crossref","unstructured":"Friedman, E.J.: Fundamental domains for integer programs with symmetries. In: International Conference on Combinatorial Optimization and Applications, pp. 146\u2013153. Springer (2007)","DOI":"10.1007\/978-3-540-73556-4_17"},{"issue":"1","key":"488_CR20","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10107-010-0351-0","volume":"131","author":"L Liberti","year":"2012","unstructured":"Liberti, L.: Reformulations in mathematical programming: automatic symmetry detection and exploitation. Math. Program. 131(1), 273\u2013304 (2012)","journal-title":"Math. Program."},{"issue":"2","key":"488_CR21","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10898-013-0106-6","volume":"60","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Ostrowski, J.: Stabilizer-based symmetry breaking constraints for mathematical programs. J. Global Optim. 60(2), 183\u2013194 (2014)","journal-title":"J. Global Optim."},{"issue":"1","key":"488_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","volume":"126","author":"J Ostrowski","year":"2011","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. Math. Program. 126(1), 147\u2013178 (2011)","journal-title":"Math. Program."},{"issue":"1","key":"488_CR23","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10107-014-0812-y","volume":"150","author":"J Ostrowski","year":"2015","unstructured":"Ostrowski, J., Anjos, M.F., Vannelli, A.: Modified orbital branching for structured symmetry with an application to unit commitment. Math. Program. 150(1), 99\u2013129 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"488_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-006-0081-5","volume":"114","author":"V Kaibel","year":"2008","unstructured":"Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Math. Program. 114(1), 1\u201336 (2008)","journal-title":"Math. Program."},{"issue":"4","key":"488_CR25","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.disopt.2011.07.001","volume":"8","author":"V Kaibel","year":"2011","unstructured":"Kaibel, V., Peinhardt, M., Pfetsch, M.E.: Orbitopal fixing. Discret. Optim. 8(4), 595\u2013610 (2011)","journal-title":"Discret. Optim."},{"issue":"1","key":"488_CR26","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-019-01457-1","volume":"186","author":"P Bendotti","year":"2021","unstructured":"Bendotti, P., Fouilhoux, P., Rottner, C.: Orbitopal fixing for the full (sub-) orbitope and application to the unit commitment problem. Math. Program. 186(1), 337\u2013372 (2021)","journal-title":"Math. Program."},{"key":"488_CR27","volume-title":"Linear Conic Optimization","author":"S-C Fang","year":"2013","unstructured":"Fang, S.-C., Xing, W.X.: Linear Conic Optimization. Science Press, Beijing (2013)"},{"key":"488_CR28","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (2009)"},{"issue":"3","key":"488_CR29","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s10589-021-00282-7","volume":"79","author":"G Liuzzi","year":"2021","unstructured":"Liuzzi, G., Locatelli, M., Piccialli, V., Rass, S.: Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex qp problems. Comput. Optim. Appl. 79(3), 561\u2013599 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"488_CR30","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","volume":"113","author":"S Burer","year":"2008","unstructured":"Burer, S., Vandenbussche, D.: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. 113(2), 259\u2013282 (2008)","journal-title":"Math. Program."},{"issue":"6","key":"488_CR31","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1080\/02331939008843615","volume":"21","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P.M.: Polynomial time algorithms for some classes of constrained nonconvex quadratic problems. Optimization 21(6), 843\u2013853 (1990)","journal-title":"Optimization"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00488-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00488-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00488-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T11:14:20Z","timestamp":1690283660000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00488-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,2]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["488"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00488-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,2]]},"assertion":[{"value":"19 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}