{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:21:33Z","timestamp":1770816093672,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T00:00:00Z","timestamp":1727049600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T00:00:00Z","timestamp":1727049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12071133"],"award-info":[{"award-number":["12071133"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s12190-024-02244-8","type":"journal-article","created":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T13:56:37Z","timestamp":1727186197000},"page":"365-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A novel global algorithm for solving linear multiplicative problem by integrating linear combination rule and branch-and-bound framework"],"prefix":"10.1007","volume":"71","author":[{"given":"Yanzhen","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Peiping","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,23]]},"reference":[{"key":"2244_CR1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.cor.2017.07.015","volume":"89","author":"H Charkhgard","year":"2017","unstructured":"Charkhgard, H., Savelsbergh, M., Talebian, M.: A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints. Comput. Oper. Res. 89, 17\u201330 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"2244_CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"J Nash","year":"1950","unstructured":"Nash, J.: The bargaining problem. Econometrica 18(2), 155\u2013162 (1950)","journal-title":"Econometrica"},{"issue":"1","key":"2244_CR3","doi-asserted-by":"crossref","first-page":"128","DOI":"10.2307\/1906951","volume":"21","author":"J Nash","year":"1953","unstructured":"Nash, J.: Two-person cooperative games. Econometrica 21(1), 128\u2013140 (1953)","journal-title":"Econometrica"},{"issue":"3","key":"2244_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01299449","volume":"2","author":"K Bennett","year":"1994","unstructured":"Bennett, K., Mangasarian, O.: Bilinear separation of two sets in $$n$$-space. Comput. Optim. Appl. 2(3), 207\u2013227 (1994)","journal-title":"Comput. Optim. Appl."},{"key":"2244_CR5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/978-1-4757-5331-8_10","volume":"9","author":"I Quesada","year":"1996","unstructured":"Quesada, I., Grossmann, I.E.: Alternative bounding applications for the global optimization of various engineering design problems. Global optimization in engineering design. Nonconvex Optim. Appl. 9, 309\u2013331 (1996)","journal-title":"Nonconvex Optim. Appl."},{"issue":"5","key":"2244_CR6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0167-6377(93)90052-I","volume":"13","author":"T Kuno","year":"1993","unstructured":"Kuno, T.: Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set. Oper. Res. Lett. 13(5), 295\u2013303 (1993)","journal-title":"Oper. Res. Lett."},{"issue":"10","key":"2244_CR7","doi-asserted-by":"crossref","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"},{"issue":"2","key":"2244_CR8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1080\/03052159508941259","volume":"25","author":"M Dorneich","year":"1995","unstructured":"Dorneich, M., Sahinidis, N.: Global optimization algorithms for chip design and compaction. Eng. Optim. 25(2), 131\u2013154 (1995)","journal-title":"Eng. Optim."},{"issue":"2","key":"2244_CR9","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/opre.43.2.264","volume":"43","author":"J Mulvey","year":"1995","unstructured":"Mulvey, J., Vanderbei, R., Zenios, S.: Robust optimization of large-scale systems. Oper. Res. 43(2), 264\u2013281 (1995)","journal-title":"Oper. Res."},{"key":"2244_CR10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF02282050","volume":"45","author":"H Konno","year":"1993","unstructured":"Konno, H., Shirakawa, H., Yamazaki, H.: A mean-absolute deviation-skewness portfolio optimization model. Ann. Oper. Res. 45, 205\u2013220 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"2244_CR11","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s11263-007-0117-1","volume":"79","author":"F Kahl","year":"2008","unstructured":"Kahl, F., Agarwal, S., Chandraker, M.K., Kriegman, D., Belongies, S.: Practical global optimization for multiview geometry. Int. J. Comput. Vision 79(3), 271\u2013284 (2008)","journal-title":"Int. J. Comput. Vision"},{"key":"2244_CR12","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.cie.2019.03.042","volume":"131","author":"S Qu","year":"2019","unstructured":"Qu, S., Zhou, Y., Zhang, Y., Wahab, M.I.M., Zhang, G., Ye, Y.: Optimal strategy for a green supply chain considering shipping policy and default risk. Comput. Ind. Eng. 131, 172\u2013186 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"2244_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-31484-6","volume-title":"Convex Analysis and Global Optimization","author":"H Tuy","year":"2016","unstructured":"Tuy, H.: Convex Analysis and Global Optimization. Kluwer Academic, Dordrecht, Netherlands, Second Edition (2016)"},{"key":"2244_CR14","doi-asserted-by":"crossref","unstructured":"Benson, H.: Global maximization of a generalized concave multiplicative function. J. Optim. Theory Appl. 137, 105\u2013120 (2008)","DOI":"10.1007\/s10957-007-9323-9"},{"issue":"3","key":"2244_CR15","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s10898-016-0436-2","volume":"67","author":"C Lu","year":"2017","unstructured":"Lu, C., Deng, Z., Jin, Q.: An eigenvalue decomposition based branch-and-bound algorithm for non-convex quadratic programming problems with convex quadratic constraints. J. Global Optim. 67(3), 475\u2013493 (2017)","journal-title":"J. Global Optim."},{"key":"2244_CR16","unstructured":"Konno, H., Yajima, Y.: Solving rank two bilinear programs by parametric simplex algorithms. Technical Report IHSS Report 90-17, Institute of Human And Social Sciences, Tokyo Institute of Technology (1990)"},{"key":"2244_CR17","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00253808","volume":"1","author":"H Konno","year":"1992","unstructured":"Konno, H., Kuno, T., Yajima, Y.: Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial. Comput. Optim. Appl. 1, 227\u2013239 (1992)","journal-title":"Comput. Optim. Appl."},{"key":"2244_CR18","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1023\/A:1024700901538","volume":"26","author":"HS Ryoo","year":"2003","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Global optimization of multiplicative programs. J. Global Optim. 26, 387\u2013418 (2003)","journal-title":"J. Global Optim."},{"key":"2244_CR19","first-page":"675","volume":"3801","author":"Y Gao","year":"2005","unstructured":"Gao, Y., Xu, C., Yang, Y.: Outcome-space branch and bound algorithm for solving linear multiplicative programming. Comput. Intell. Secur. 3801, 675\u2013681 (2005)","journal-title":"Comput. Intell. Secur."},{"issue":"2","key":"2244_CR20","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10255-015-0456-6","volume":"31","author":"X Zhou","year":"2015","unstructured":"Zhou, X., Cao, B., Wu, K.: Gobal optimization method for linear multiplicative programming. Acta Math. Appl. Sin. 31(2), 325\u2013334 (2015)","journal-title":"Acta Math. Appl. Sin."},{"issue":"1","key":"2244_CR21","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s00186-009-0289-2","volume":"71","author":"R Cambini","year":"2010","unstructured":"Cambini, R., Sodini, C.: Global optimization of a rank-two nonconvex program. Math. Methods Oper. Res. 71(1), 165\u2013180 (2010)","journal-title":"Math. Methods Oper. Res."},{"issue":"1","key":"2244_CR22","volume":"2024","author":"L Yang","year":"2014","unstructured":"Yang, L., Shen, P., Pei, Y.: A global optimization approach for solving generalized nonlinear multiplicative programming problem. Abstr. Appl. Anal. 2024(1), 641909 (2014)","journal-title":"Abstr. Appl. Anal."},{"key":"2244_CR23","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1016\/j.cam.2015.11.009","volume":"296","author":"S Liu","year":"2016","unstructured":"Liu, S., Zhao, Y.: An efficient algorithm for globally solving generalized linear multiplicative programming ScienceDirect. J. Comput. Appl. Math. 296, 840\u2013847 (2016)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"2244_CR24","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/02331934.2016.1269765","volume":"66","author":"C Wang","year":"2017","unstructured":"Wang, C., Bai, Y., Shen, P.: A practicable branch-and-bound algorithm for globally solving multiplicative programming. Optimization 66(3), 397\u2013405 (2017)","journal-title":"Optimization"},{"issue":"1","key":"2244_CR25","first-page":"1","volume":"2018","author":"Y Zhao","year":"2018","unstructured":"Zhao, Y., Zhao, T.: Global optimization for generalized linear multiplicative programming using convex relaxation. Math. Prob. Eng. 2018(1), 1\u20138 (2018)","journal-title":"Math. Prob. Eng."},{"key":"2244_CR26","doi-asserted-by":"crossref","first-page":"162245","DOI":"10.1109\/ACCESS.2019.2951515","volume":"7","author":"J Yin","year":"2019","unstructured":"Yin, J., Jiao, H., Shang, Y.: Global algorithm for generalized affine multiplicative programming Problem. IEEE Access 7, 162245\u2013162253 (2019)","journal-title":"IEEE Access"},{"key":"2244_CR27","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/s11590-018-1378-z","volume":"14","author":"P Shen","year":"2020","unstructured":"Shen, P., Huang, B.: Global algorithm for solving linear multiplicative programming problems. Optim. Lett. 14, 693\u2013710 (2020)","journal-title":"Optim. Lett."},{"issue":"6","key":"2244_CR28","doi-asserted-by":"crossref","first-page":"1421","DOI":"10.1080\/02331934.2020.1812603","volume":"71","author":"P Shen","year":"2022","unstructured":"Shen, P., Wang, K., Lu, T.: Global optimization algorithm for solving linear multiplicative programming problems. Optimization 71(6), 1421\u20131441 (2022)","journal-title":"Optimization"},{"key":"2244_CR29","first-page":"1","volume":"2024","author":"B Huang","year":"2024","unstructured":"Huang, B., Shen, P.: A new branch-and-bound methos for solving linear multiplicative problems. Optimization 2024, 1\u201321 (2024)","journal-title":"Optimization"},{"key":"2244_CR30","volume":"450","author":"Y Zhang","year":"2024","unstructured":"Zhang, Y., Shen, P., Huang, B., Deng, Y.: An efficent branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs. J. Comput. Appl. Math. 450, 116035 (2024)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"2244_CR31","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1186\/s13660-017-1342-y","volume":"2017","author":"P Shen","year":"2017","unstructured":"Shen, P., Wang, C.: Linear decomposition approach for a class of nonconvex programming problems. J. Inequal. Appl. 2017(1), 74 (2017)","journal-title":"J. Inequal. Appl."},{"issue":"2","key":"2244_CR32","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1007\/s11075-020-01065-7","volume":"88","author":"H Luo","year":"2021","unstructured":"Luo, H., Chen, S., Wu, H.: A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation. Numer. Algoritm. 88(2), 993\u20131024 (2021)","journal-title":"Numer. Algoritm."},{"key":"2244_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.camwa.2021.10.005","volume":"2021","author":"B Zhang","year":"2021","unstructured":"Zhang, B., Gao, Y., Liu, X., Huang, X.: An efficient polynomial time algorithm for a class of generalied linear multiplicative programming. J. Comput. Appl. Math. 2021, 1\u201312 (2021)","journal-title":"J. Comput. Appl. Math."},{"key":"2244_CR34","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s12532-018-0142-9","volume":"11","author":"H Luo","year":"2019","unstructured":"Luo, H., Bai, X., Lim, G., et al.: New global algorithms for quaadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation. Math. Program. Comput. 11, 119\u2013171 (2019)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"2244_CR35","doi-asserted-by":"crossref","first-page":"315","DOI":"10.3390\/math8030315","volume":"8","author":"B Zhang","year":"2020","unstructured":"Zhang, B., Gao, Y., Liu, X., Huang, X.: Output-space branch-and-bound reduction algorithm for a class of linear multiplicative programs. Mathematics 8(3), 315 (2020)","journal-title":"Mathematics"},{"key":"2244_CR36","first-page":"1","volume":"99","author":"H Jiao","year":"2020","unstructured":"Jiao, H., Wang, W., Chen, R., Shang, Y., Yin, J.: An efficient outer space algorithm for generalized linear multiplicative programming problem. IEEE Access 99, 1\u20131 (2020)","journal-title":"IEEE Access"},{"key":"2244_CR37","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2022.114784","volume":"419","author":"H Jiao","year":"2023","unstructured":"Jiao, H., Wang, W., Shang, Y.: Outer space branch-reduction-bound algorithm for globally generalized affine multiplicative problems. J. Comput. Appl. Math. 419, 114784 (2023)","journal-title":"J. Comput. Appl. Math."},{"key":"2244_CR38","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10898-020-00919-7","volume":"78","author":"P Shen","year":"2020","unstructured":"Shen, P., Wang, K., Lu, T.: Outer space branch and bound algorithm for solving linear multiplicative programming problems. J. Glob. Optim. 78, 453\u2013482 (2020)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"2244_CR39","first-page":"494","volume":"179","author":"Y Gao","year":"2006","unstructured":"Gao, Y., Xu, C., Yang, Y.: 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":"2244_CR40","doi-asserted-by":"crossref","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. Glob. Optim. 47(1), 107\u2013118 (2010)","journal-title":"J. Glob. Optim."},{"key":"2244_CR41","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2021.114080","volume":"407","author":"C Wang","year":"2022","unstructured":"Wang, C., Deng, Y., Shen, 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":"2","key":"2244_CR42","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10898-023-01277-w","volume":"86","author":"P Shen","year":"2023","unstructured":"Shen, P., Wu, D., Wang, K.: Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound. J. Glob. Optim. 86(2), 303\u2013321 (2023)","journal-title":"J. Glob. Optim."},{"key":"2244_CR43","first-page":"1","volume":"2023","author":"P Shen","year":"2023","unstructured":"Shen, P., Deng, Y., Wu, D.: A criterion space algorithm for solving linear multiplicative programming problems. Numer. Algoritm. 2023, 1\u201323 (2023)","journal-title":"Numer. Algoritm."},{"key":"2244_CR44","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2023.115100","volume":"426","author":"P Shen","year":"2023","unstructured":"Shen, P., Wu, D., Wang, Y.: An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming problems. J. Comput. Appl. Math. 426, 115100 (2023)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"2244_CR45","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/s10287-023-00471-1","volume":"20","author":"R Cambini","year":"2023","unstructured":"Cambini, R., Riccardi, R., Scopelliti, D.: Solving linear multiplicative programs via branch-and-bound: a computational experience. Comput. Manage. Sci. 20(1), 38 (2023)","journal-title":"Comput. Manage. Sci."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02244-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-024-02244-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02244-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T20:00:05Z","timestamp":1737662405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-024-02244-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,23]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2244"],"URL":"https:\/\/doi.org\/10.1007\/s12190-024-02244-8","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,23]]},"assertion":[{"value":"22 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential Conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}