{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T04:40:19Z","timestamp":1769748019398,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T00:00:00Z","timestamp":1653436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T00:00:00Z","timestamp":1653436800000},"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":["11701177"],"award-info":[{"award-number":["11701177"]}],"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":["11771287"],"award-info":[{"award-number":["11771287"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s11590-022-01891-9","type":"journal-article","created":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T12:02:31Z","timestamp":1653480151000},"page":"613-628","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters"],"prefix":"10.1007","volume":"17","author":[{"given":"Cheng","family":"Lu","sequence":"first","affiliation":[]},{"given":"Junhao","family":"Wu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0563-5841","authenticated-orcid":false,"given":"Zhibin","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Shaoze","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,25]]},"reference":[{"key":"1891_CR1","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1016\/j.cor.2008.02.013","volume":"36","author":"A Agnetis","year":"2009","unstructured":"Agnetis, A., Grande, E., Mirchandani, P.B., Pacifici, A.: Covering a line segment with variable radius discs. Comput. Op. Res. 36, 1423\u20131436 (2009)","journal-title":"Comput. Op. Res."},{"key":"1891_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10107-010-0398-y","volume":"132","author":"A Agnetis","year":"2012","unstructured":"Agnetis, A., Grande, E., Pacifici, A.: Demand allocation with latency cost functions. Math. Program. 132, 277\u2013294 (2012)","journal-title":"Math. Program."},{"key":"1891_CR3","unstructured":"Dong, H., Chen, K., Linderoth, J.: Regularization vs. relaxation: A conic optimization perspective of statistical variable selection. http:\/\/arxiv.org\/abs\/1510.06083 (2015)"},{"key":"1891_CR4","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1287\/opre.1110.0930","volume":"59","author":"A Frangioni","year":"2011","unstructured":"Frangioni, A., Gentile, C., Grande, E., Pacifici, A.: Projected perspective reformulations with applications in design problems. Op. Res. 59, 1225\u20131232 (2011)","journal-title":"Op. Res."},{"key":"1891_CR5","doi-asserted-by":"crossref","unstructured":"Friedman, E. J.: Fundamental domains for integer programs with symmetries. international conference on combinatorial optimization and applications (COCOA), 146\u2013153, Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-73556-4_17"},{"key":"1891_CR6","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1109\/TPWRS.2003.810676","volume":"18","author":"FD Galiana","year":"2003","unstructured":"Galiana, F.D., Motto, A.L., Bouffard, F.: Reconciling social welfare, agent profits, and consumer payments in electricity pools. IEEE Trans. Power. Syst. 18, 452\u2013459 (2003)","journal-title":"IEEE Trans. Power. Syst."},{"key":"1891_CR7","unstructured":"Han, S., G\u00f3mez, A., Atamt\u00fcrk, A. 2x2 convexifications for convex quadratic optimization with indicator variables. http:\/\/arxiv.org\/abs\/2004.07448 (2020)"},{"key":"1891_CR8","doi-asserted-by":"publisher","first-page":"4496","DOI":"10.1109\/TPWRS.2017.2783850","volume":"33","author":"B Knueven","year":"2017","unstructured":"Knueven, B., Ostrowski, J., Watson, J.P.: Exploiting identical generators in unit commitment. IEEE Trans. Power Syst. 33, 4496\u20134507 (2017)","journal-title":"IEEE Trans. Power Syst."},{"key":"1891_CR9","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, 273\u2013304 (2012)","journal-title":"Math. Program."},{"key":"1891_CR10","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. Glob. Optim. 60, 183\u2013194 (2014)","journal-title":"J. Glob. Optim."},{"key":"1891_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-019-00489-9","author":"C Lu","year":"2019","unstructured":"Lu, C., Deng, Z., Fang, S.-C., Jin, Q., Xing, W.: Fast computation of global solutions to the single-period unit commitment problem. J. Comb. Optim.\u00a0(2019). https:\/\/doi.org\/10.1007\/s10878-019-00489-9","journal-title":"J. Comb. Optim."},{"key":"1891_CR12","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, 147\u2013178 (2011)","journal-title":"Math. Program."},{"key":"1891_CR13","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, 99\u2013129 (2015)","journal-title":"Math. Program."},{"key":"1891_CR14","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2004","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (2004)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01891-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01891-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01891-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T12:16:05Z","timestamp":1678277765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01891-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,25]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1891"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01891-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,25]]},"assertion":[{"value":"8 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}