{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T12:10:36Z","timestamp":1774959036081,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s11432-024-4210-2","type":"journal-article","created":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T22:21:28Z","timestamp":1734128488000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A distributed decomposition algorithm for solving large-scale mixed integer programming problem"],"prefix":"10.1007","volume":"67","author":[{"given":"Fangzheng","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongzhe","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenwu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,11]]},"reference":[{"key":"4210_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M R Garey","year":"1979","unstructured":"Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman, 1979"},{"key":"4210_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_5","volume-title":"An Automatic Method for Solving Discrete Programming Problems","author":"A H Land","year":"2010","unstructured":"Land A H, Doig A G. An Automatic Method for Solving Discrete Programming Problems. Berlin: Springer, 2010"},{"key":"4210_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E Balas","year":"1996","unstructured":"Balas E, Ceria S, Cornu\u00e9jols G, et al. Gomory cuts revisited. Oper Res Lett, 1996, 19: 1\u20139","journal-title":"Oper Res Lett"},{"key":"4210_CR4","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"O K Gupta","year":"1985","unstructured":"Gupta O K, Ravindran A. Branch and bound experiments in convex nonlinear integer programming. Manage Sci, 1985, 31: 1533\u20131546","journal-title":"Manage Sci"},{"key":"4210_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A M Geoffrion","year":"1972","unstructured":"Geoffrion A M. Generalized benders decomposition. J Optim Theor Appl, 1972, 10: 237\u2013260","journal-title":"J Optim Theor Appl"},{"key":"4210_CR6","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10957-011-9888-1","volume":"151","author":"X Li","year":"2011","unstructured":"Li X, Tomasgard A, Barton P I. Nonconvex generalized benders decomposition for stochastic separable mixed-integer nonlinear programs. J Optim Theor Appl, 2011, 151: 425\u2013454","journal-title":"J Optim Theor Appl"},{"key":"4210_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"19","author":"T Westerlund","year":"1995","unstructured":"Westerlund T, Pettersson F. An extended cutting plane method for solving convex MINLP problems. Comput Chem Eng, 1995, 19: 131\u2013136","journal-title":"Comput Chem Eng"},{"key":"4210_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M A Duran","year":"1986","unstructured":"Duran M A, Grossmann I E. An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math Programm, 1986, 36: 307\u2013339","journal-title":"Math Programm"},{"key":"4210_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1287\/ijoc.1120.0545","volume":"26","author":"H Hijazi","year":"2014","unstructured":"Hijazi H, Bonami P, Ouorou A. An outer-inner approximation for separable mixed-integer nonlinear programs. INFORMS J Comput, 2014, 26: 31\u201344","journal-title":"INFORMS J Comput"},{"key":"4210_CR10","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s10898-018-0616-3","volume":"71","author":"J Kronqvist","year":"2018","unstructured":"Kronqvist J, Lundell A, Westerlund T. Reformulations for utilizing separability when solving convex MINLP problems. J Glob Optim, 2018, 71: 571\u2013592","journal-title":"J Glob Optim"},{"key":"4210_CR11","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1057\/palgrave.jors.2600425","volume":"48","author":"D P Bertsekas","year":"1997","unstructured":"Bertsekas D P. Nonlinear programming. J Oper Res Soc, 1997, 48: 334","journal-title":"J Oper Res Soc"},{"key":"4210_CR12","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1109\/TCNS.2019.2925267","volume":"7","author":"I Notarnicola","year":"2019","unstructured":"Notarnicola I, Notarstefano G. Constraint-coupled distributed optimization: a relaxation and duality approach. IEEE Trans Control Netw Syst, 2019, 7: 483\u2013492","journal-title":"IEEE Trans Control Netw Syst"},{"key":"4210_CR13","doi-asserted-by":"publisher","first-page":"100595","DOI":"10.1016\/j.disopt.2020.100595","volume":"38","author":"E Karabulut","year":"2020","unstructured":"Karabulut E, Ahmed S, Nemhauser G. Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint. Discrete Optim, 2020, 38: 100595","journal-title":"Discrete Optim"},{"key":"4210_CR14","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1109\/TAC.2021.3057061","volume":"67","author":"A Camisa","year":"2022","unstructured":"Camisa A, Notarnicola I, Notarstefano G. Distributed primal decomposition for large-scale MILPs. IEEE Trans Autom Control, 2022, 67: 413\u2013420","journal-title":"IEEE Trans Autom Control"},{"key":"4210_CR15","doi-asserted-by":"publisher","first-page":"1854","DOI":"10.1287\/opre.2021.2210","volume":"70","author":"B Y\u0131ld\u0131z","year":"2022","unstructured":"Y\u0131ld\u0131z B, Boland N, Savelsbergh M. Decomposition branching for mixed integer programming. Oper Res, 2022, 70: 1854\u20131872","journal-title":"Oper Res"},{"key":"4210_CR16","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-021-01765-5","volume":"196","author":"M Bodur","year":"2022","unstructured":"Bodur M, Ahmed S, Boland N, et al. Decomposition of loosely coupled integer programs: a multiobjective perspective. Math Program, 2022, 196: 427\u2013477","journal-title":"Math Program"},{"key":"4210_CR17","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.automatica.2016.01.006","volume":"67","author":"R Vujanic","year":"2016","unstructured":"Vujanic R, Esfahani P M, Goulart P J, et al. A decomposition method for large scale MILPs, with performance guarantees and a power system application. Automatica, 2016, 67: 144\u2013156","journal-title":"Automatica"},{"key":"4210_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.automatica.2019.01.009","volume":"103","author":"A Falsone","year":"2019","unstructured":"Falsone A, Margellos K, Prandini M. A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees. Automatica, 2019, 103: 141\u2013150","journal-title":"Automatica"},{"key":"4210_CR19","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1109\/TAC.2019.2920812","volume":"65","author":"A Testa","year":"2019","unstructured":"Testa A, Rucco A, Notarstefano G. Distributed mixed-integer linear programming via cut generation and constraint exchange. IEEE Trans Autom Control, 2019, 65: 1456\u20131467","journal-title":"IEEE Trans Autom Control"},{"key":"4210_CR20","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1007\/s11432-010-0114-9","volume":"53","author":"B Xin","year":"2010","unstructured":"Xin B, Chen J, Peng Z H, et al. An adaptive hybrid optimizer based on particle swarm and differential evolution for global optimization. Sci China Inf Sci, 2010, 53: 980\u2013989","journal-title":"Sci China Inf Sci"},{"key":"4210_CR21","doi-asserted-by":"publisher","first-page":"068102","DOI":"10.1007\/s11432-015-0594-2","volume":"60","author":"Y Zhou","year":"2017","unstructured":"Zhou Y, He F Z, Qiu Y M. Dynamic strategy based parallel ant colony optimization on GPUs for TSPs. Sci China Inf Sci, 2017, 60: 068102","journal-title":"Sci China Inf Sci"},{"key":"4210_CR22","doi-asserted-by":"crossref","first-page":"112101","DOI":"10.1007\/s11432-022-3952-3","volume":"68","author":"X L Lv","year":"2025","unstructured":"Lv X L, Zhai Q Z, Hu J C, et al. An efficient binary programming method for black-box optimization and its application in processor design. Sci China Inf Sci, 2025, 68: 112101","journal-title":"Sci China Inf Sci"},{"key":"4210_CR23","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/0308003","volume":"8","author":"R Meyer","year":"1970","unstructured":"Meyer R. The validity of a family of optimization methods. SIAM J Control, 1970, 8: 41\u201354","journal-title":"SIAM J Control"},{"key":"4210_CR24","volume-title":"Convex Analysis","author":"J Borwein","year":"2006","unstructured":"Borwein J, Lewis A. Convex Analysis. New York: Springer, 2006"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-024-4210-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-024-4210-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-024-4210-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T20:34:16Z","timestamp":1768854856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-024-4210-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":24,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["4210"],"URL":"https:\/\/doi.org\/10.1007\/s11432-024-4210-2","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"26 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"222205"}}