{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T01:42:59Z","timestamp":1759542179095,"version":"3.44.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T00:00:00Z","timestamp":1729209600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T00:00:00Z","timestamp":1729209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Young Science and Technology Nova Program of Shaanxi Province","award":["2022KJXX-01"],"award-info":[{"award-number":["2022KJXX-01"]}]},{"name":"the Graduate Innovation Project of North Minzu University","award":["YCX24253"],"award-info":[{"award-number":["YCX24253"]}]},{"name":"the Construction Project of first-class subjects in Ningxia higher Education","award":["NXYLXK2017B09"],"award-info":[{"award-number":["NXYLXK2017B09"]}]},{"name":"the Basic discipline research projects supported by Nanjing Securities","award":["NJZQJCXK202201"],"award-info":[{"award-number":["NJZQJCXK202201"]}]},{"name":"the major proprietary funded project of North Minzu University","award":["ZDZX201901"],"award-info":[{"award-number":["ZDZX201901"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science foundations of China","doi-asserted-by":"crossref","award":["12461053, 11961001"],"award-info":[{"award-number":["12461053, 11961001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s11075-024-01961-2","type":"journal-article","created":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T01:02:07Z","timestamp":1729213327000},"page":"311-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An efficient outcome-space branch-and-bound algorithm for solving a class of large-scale linear multiplicative programs"],"prefix":"10.1007","volume":"100","author":[{"given":"Xia","family":"Jing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohua","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuelin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xia","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,18]]},"reference":[{"issue":"1","key":"1961_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10589-023-00488-x","volume":"86","author":"SZ Li","year":"2023","unstructured":"Li, S.Z., Deng, Z.B., Lu, C., Wu, J.H., Dai, J.Y.: An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints. Comput. Optim. Appl. 86(1), 241\u2013273 (2023)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1961_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10898-022-01255-8","volume":"86","author":"B Zhang","year":"2023","unstructured":"Zhang, B., Gao, Y.L., Liu, X., Huang, X.L.: Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems. J. Global Optim. 86(1), 61\u201392 (2023)","journal-title":"J. Global Optim."},{"issue":"3","key":"1961_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01299449","volume":"2","author":"KP Bennett","year":"1993","unstructured":"Bennett, K.P., Mangasarian, O.L.: Bilinear separation of two sets in $$n$$-space. Comput. Optim. Appl. 2(3), 207\u2013227 (1993)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1961_CR4","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BF03398773","volume":"43","author":"R Kapoor","year":"2006","unstructured":"Kapoor, R., Arora, S.R.: Linearization of a 0\u20131 quadratic fractional programming problem. Opsearch 43(2), 190\u2013207 (2006)","journal-title":"Opsearch"},{"key":"1961_CR5","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s40032-020-00576-5","volume":"101","author":"AM Qamar","year":"2020","unstructured":"Qamar, A.M., Meanazel, O.T., Alalawin, A.H., Almomani, H.A.: Optimization of plant layout in Jordan light Vehicle manufacturing company. J. Inst. Eng. India. Ser. C. 101, 721\u2013728 (2020)","journal-title":"J. Inst. Eng. India. Ser. C."},{"issue":"2","key":"1961_CR6","first-page":"143","volume":"32","author":"H Konno","year":"2017","unstructured":"Konno, H., Inori, M.: Bond portfolio optimization by bilinear fractional programming. J. Oper. Res. Soc. Jpn. 32(2), 143\u2013158 (2017)","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"1","key":"1961_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-020-03544-5","volume":"288","author":"NA Alreshidi","year":"2020","unstructured":"Alreshidi, N.A., Mrad, M., Subasi, E., Subasi, M.M.: Two-stage bond portfolio optimization and its application to Saudi Sukuk Market. Ann. Oper. Res. 288(1), 1\u201343 (2020)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"1961_CR8","doi-asserted-by":"publisher","first-page":"1414","DOI":"10.1111\/eufm.12265","volume":"26","author":"CW Chang","year":"2020","unstructured":"Chang, C.W., Chang, J.S.K., Yu, M., Zhao, Y.: Portfolio optimization in the catastrophe space. Eur. Financ. Manag. 26(5), 1414\u20131448 (2020)","journal-title":"Eur. Financ. Manag."},{"key":"1961_CR9","doi-asserted-by":"publisher","first-page":"2003","DOI":"10.1007\/s10586-023-04020-y","volume":"27","author":"L Chen","year":"2024","unstructured":"Chen, L., Feng, C.Z., Ma, Y.P.: Improved Harris Hawks optimization for global optimization and engineering design. Cluster. Comput. 27, 2003\u20132027 (2024)","journal-title":"Cluster. Comput."},{"issue":"8\/9","key":"1961_CR10","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1016\/S0165-1889(97)00032-8","volume":"21","author":"CD Maranas","year":"1997","unstructured":"Maranas, C.D., Androulakis, I.P., Floudas, C.A., Berger, A.J., Mulvey, J.M.: Solving long-term financial planning problems via global optimization. J. Econ. Dyn. Control. 21(8\/9), 1405\u20131425 (1997)","journal-title":"J. Econ. Dyn. Control."},{"key":"1961_CR11","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10601-023-09367-y","volume":"28","author":"J Boutilier","year":"2023","unstructured":"Boutilier, J., Michini, C., Zhou, Z.: Optimal multivariate decision trees. Constraints 28, 549\u2013577 (2023)","journal-title":"Constraints"},{"issue":"2","key":"1961_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/03052159508941259","volume":"25","author":"MC Dorneich","year":"1995","unstructured":"Dorneich, M.C., Sahinidis, N.V.: Global optimization algorithms for chip layout and compaction. Eng. Optim. 25(2), 131\u2013154 (1995)","journal-title":"Eng. Optim."},{"issue":"2","key":"1961_CR13","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1287\/opre.43.2.264","volume":"43","author":"JM Mulvey","year":"1995","unstructured":"Mulvey, J.M., Vanderbei, R.J., Zenios, S.A.: Robust optimization of large-scale systems. Oper. Res. 43(2), 264\u2013281 (1995)","journal-title":"Oper. Res."},{"issue":"10","key":"1961_CR14","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1080\/02331934.2013.852548","volume":"63","author":"R Cambini","year":"2014","unstructured":"Cambini, R., Sodini, C.: On the minimization of a class of generalized linear functions on a flow polytope. Optimization 63(10), 1449\u20131464 (2014)","journal-title":"Optimization"},{"key":"1961_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.compchemeng.2015.08.022","volume":"84","author":"B Grimstad","year":"2016","unstructured":"Grimstad, B., Foss, B., Heddle, R., Woodman, M.: Global optimization of multiphase flow networks using spline surrogate models. Comput. Chem. Eng. 84, 237\u2013254 (2016)","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"1961_CR16","first-page":"1446","volume":"33","author":"XJ Zhu","year":"2021","unstructured":"Zhu, X.J., Tang, S.J.: A branch-and-bound algorithm for building optimal data gathering tree in wireless sensor networks. Informs. J. Comput. 33(4), 1446\u20131460 (2021)","journal-title":"Informs. J. Comput."},{"key":"1961_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719437","volume-title":"Generalized concavity","author":"M Avriel","year":"2010","unstructured":"Avriel, M., Diewer, W.E., Schaible, S., Zang, I.: Generalized concavity. Society for Industrial and Applied Mathematic Press, New York (2010)"},{"issue":"2","key":"1961_CR18","first-page":"494","volume":"179","author":"YL Gao","year":"2006","unstructured":"Gao, Y.L., Xu, C.X., Yang, Y.J.: An outcome-space finite algorithm for solving linear multiplicative programming. Appl. Math. Comput. 179(2), 494\u2013505 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"1961_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10898-009-9460-9","volume":"47","author":"RM Oliveira","year":"2010","unstructured":"Oliveira, R.M., Ferreira, P.A.V.: An outcome space approach for generalized convex multiplicative programs. J. Global Optim. 47(1), 107\u2013118 (2010)","journal-title":"J. Global Optim."},{"issue":"2","key":"1961_CR20","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1137\/16M107428X","volume":"29","author":"P Bonami","year":"2019","unstructured":"Bonami, P., Lodi, A., Schweiger, J., Tramontaniet, A.: Solving quadratic programming by cutting planes. SIAM J. Optim. 29(2), 1076\u20131105 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1961_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10957-005-2655-4","volume":"126","author":"HP Benson","year":"2005","unstructured":"Benson, H.P.: Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints. J. Optim. Theory Appl. 126(1), 41\u201361 (2005)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"1961_CR22","first-page":"1206","volume":"216","author":"YL Gao","year":"2010","unstructured":"Gao, Y.L., Wu, G.R., Ma, W.M.: A new global optimization approach for convex multiplicative programming. Appl. Math. Comput. 216(4), 1206\u20131218 (2010)","journal-title":"Appl. Math. Comput."},{"key":"1961_CR23","doi-asserted-by":"publisher","first-page":"113924","DOI":"10.1016\/j.chaos.2023.113924","volume":"175","author":"YL Gao","year":"2023","unstructured":"Gao, Y.L., Zhang, B.: Output-space branch-and-bound reduction algorithm for generalized linear fractional-multiplicative programming problem. Chaos Soliton. Fract. 175, 113924 (2023)","journal-title":"Chaos Soliton. Fract."},{"key":"1961_CR24","doi-asserted-by":"publisher","first-page":"114144","DOI":"10.1016\/j.chaos.2023.114144","volume":"176","author":"ZS Hou","year":"2023","unstructured":"Hou, Z.S., Liu, S.Y.: A spatial branch-reduction-bound algorithm for solving generalized linear fractional problems globally. Chaos Soliton. Fract. 176, 114144 (2023)","journal-title":"Chaos Soliton. Fract."},{"issue":"1","key":"1961_CR25","first-page":"97","volume":"19","author":"HW Jiao","year":"2023","unstructured":"Jiao, H.W., Wang, W.J., Shen, P.P.: Piecewise linear relaxation method for globally solving a class of multiplicative problems. Pac. J. Optim. 19(1), 97\u2013118 (2023)","journal-title":"Pac. J. Optim."},{"key":"1961_CR26","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s40305-021-00375-4","volume":"11","author":"HW Jiao","year":"2023","unstructured":"Jiao, H.W., Shang, Y.L.: Two-level linear relaxation method for generalized linear fractional programming. J. Oper. Res. Soc. China 11, 569\u2013594 (2023)","journal-title":"J. Oper. Res. Soc. China"},{"key":"1961_CR27","doi-asserted-by":"publisher","first-page":"114784","DOI":"10.1016\/j.cam.2022.114784","volume":"419","author":"HW Jiao","year":"2023","unstructured":"Jiao, H.W., Wang, W.J., Shang, Y.L.: Outer space branch reduction bound algorithm for solving generalized affine multiplicative problems. J. Comput. Appl. Math. 419, 114784 (2023)","journal-title":"J. Comput. Appl. Math."},{"key":"1961_CR28","doi-asserted-by":"publisher","first-page":"114080","DOI":"10.1016\/j.cam.2021.114080","volume":"407","author":"CF Wang","year":"2022","unstructured":"Wang, C.F., Deng, Y.P., Shen, P.P.: A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems. J. Comput. Appl. Math. 407, 114080 (2022)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"1961_CR29","first-page":"1","volume":"8","author":"B Zhang","year":"2022","unstructured":"Zhang, B., Wang, H.Y., Gao, Y.L.: A D.C. relaxation based branch-and-bound algorithm for sum-of-linear-products programming problems. Oper. Res. T. 8(3), 1\u201317 (2022)","journal-title":"Oper. Res. T."},{"issue":"11","key":"1961_CR30","doi-asserted-by":"publisher","first-page":"26045","DOI":"10.3934\/math.20231327","volume":"8","author":"XL Huang","year":"2023","unstructured":"Huang, X.L., Gao, Y.L.: An efficient outer space branch-and-bound algorithm for globally minimizing linear multiplicative problems. AIMS Math. 8(11), 26045\u201326069 (2023)","journal-title":"AIMS Math."},{"issue":"3","key":"1961_CR31","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10898-020-00919-7","volume":"78","author":"PP Shen","year":"2020","unstructured":"Shen, P.P., Wang, K.M., Lu, T.: Outer space branch and bound algorithm for solving linear multiplicative programming problems. J. Global Optim. 78(3), 453\u2013482 (2020)","journal-title":"J. Global Optim."},{"issue":"3","key":"1961_CR32","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s11590-018-1378-z","volume":"14","author":"PP Shen","year":"2020","unstructured":"Shen, P.P., Huang, B.D.: Global algorithm for solving linear multiplicative programming problems. Optim. Lett. 14(3), 693\u2013710 (2020)","journal-title":"Optim. Lett."},{"issue":"6","key":"1961_CR33","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1080\/02331934.2020.1812603","volume":"71","author":"PP Shen","year":"2022","unstructured":"Shen, P.P., Wang, K.M., Lu, T.: Global optimization algorithm for solving linear multiplicative programming problems. Optimization 71(6), 1421\u20131441 (2022)","journal-title":"Optimization"},{"key":"1961_CR34","doi-asserted-by":"crossref","unstructured":"Shen, P.P., Deng, Y.P., Wu, D.X.: A criterion space algorithm for solving linear multiplicative programming problems. Numer. Algor., (2023). https:\/\/doi.org\/10.1007\/s11075-023-01689-5","DOI":"10.1007\/s11075-023-01689-5"},{"key":"1961_CR35","doi-asserted-by":"publisher","first-page":"115100","DOI":"10.1016\/j.cam.2023.115100","volume":"426","author":"PP Shen","year":"2023","unstructured":"Shen, P.P., Wu, D.X., Wang, Y.F.: An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming. J. Comput. Appl. Math. 426, 115100 (2023)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"1961_CR36","first-page":"1","volume":"95","author":"B Zhang","year":"2023","unstructured":"Zhang, B., Gao, Y.L., Liu, X., Huang, X.L.: Interval division and linearization algorithm for minimax linear fractional program. Numer. Algor. 95(2), 1\u201320 (2023)","journal-title":"Numer. Algor."},{"issue":"1","key":"1961_CR37","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1186\/s40064-016-2984-9","volume":"5","author":"YF Zhao","year":"2016","unstructured":"Zhao, Y.F., Liu, S.Y.: An efficient method for generalized linear multiplicative programming problem with multiplicative constraints. SpringerPlus 5(1), 1302 (2016)","journal-title":"SpringerPlus"},{"key":"1961_CR38","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/j.cam.2015.11.009","volume":"296","author":"SY Liu","year":"2016","unstructured":"Liu, S.Y., Zhao, Y.F.: An efficient algorithm for globally solving generalized linear multiplicative programming. J. Comput. Appl. Math. 296, 840\u2013847 (2016)","journal-title":"J. Comput. Appl. Math."},{"key":"1961_CR39","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1008314922240","volume":"18","author":"H Konno","year":"2000","unstructured":"Konno, H., Fukaishi, K.: A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems. J. Global Optim. 18, 283\u2013299 (2000)","journal-title":"J. Global Optim."},{"issue":"1","key":"1961_CR40","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/B:COAP.0000004976.52180.7f","volume":"27","author":"HP Benson","year":"2004","unstructured":"Benson, H.P.: On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals. Comput. Optim. Appl. 27(1), 5\u201322 (2004)","journal-title":"Comput. Optim. Appl."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01961-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01961-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01961-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T23:21:17Z","timestamp":1757114477000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01961-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,18]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["1961"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01961-2","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2024,10,18]]},"assertion":[{"value":"9 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 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":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}