{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T04:14:33Z","timestamp":1744776873147,"version":"3.40.4"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T00:00:00Z","timestamp":1720224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T00:00:00Z","timestamp":1720224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2022TD001,2019-ZYQNJS-002","2023JJ002"],"award-info":[{"award-number":["2022TD001,2019-ZYQNJS-002","2023JJ002"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s11590-024-02136-7","type":"journal-article","created":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T13:01:25Z","timestamp":1720270885000},"page":"793-809","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved randomized approaches to the location of a conservative hyperplane"],"prefix":"10.1007","volume":"19","author":[{"given":"Xiaosong","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5803-8840","authenticated-orcid":false,"given":"Xi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,6]]},"reference":[{"key":"2136_CR1","doi-asserted-by":"crossref","unstructured":"Jeong, J., Sanner, S., Kumar, A.: A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 79\u2013 95 ( 2023). Springer","DOI":"10.1007\/978-3-031-33271-5_6"},{"issue":"3","key":"2136_CR2","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1016\/j.ejor.2021.06.014","volume":"298","author":"C Fu","year":"2022","unstructured":"Fu, C., Zhu, N., Ma, S., Liu, R.: A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems. Eur. J. Oper. Res. 298(3), 915\u2013938 (2022)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2136_CR3","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1287\/ijoc.2020.1014","volume":"33","author":"J-F C\u00f4t\u00e9","year":"2021","unstructured":"C\u00f4t\u00e9, J.-F., Haouari, M., Iori, M.: Combinatorial benders decomposition for the two-dimensional bin packing problem. INFORMS J. Comput. 33(3), 963\u2013978 (2021)","journal-title":"INFORMS J. Comput."},{"key":"2136_CR4","doi-asserted-by":"publisher","first-page":"012067","DOI":"10.1088\/1742-6596\/2527\/1\/012067","volume":"2527","author":"Y He","year":"2023","unstructured":"He, Y., Xie, Y., Cheng, C., Liu, B., Xiao, Q., Fan, X., Liang, H., Gong, X.: A method for calculating aggregate flexibility parameters of virtual power plant based on improved column and constraint generation algorithm. J. Phys. Conf. Ser. 2527, 012067 (2023)","journal-title":"J. Phys. Conf. Ser."},{"issue":"2","key":"2136_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/PL00011428","volume":"90","author":"S Alarie","year":"2001","unstructured":"Alarie, S., Audet, C., Jaumard, B., Savard, G.: Concavity cuts for disjoint bilinear programming. Math. Program. 90(2), 373\u2013398 (2001)","journal-title":"Math. Program."},{"issue":"7","key":"2136_CR6","doi-asserted-by":"publisher","first-page":"1677","DOI":"10.1007\/s11590-018-01382-w","volume":"13","author":"X Chen","year":"2019","unstructured":"Chen, X., Zhang, J., Ding, X., Yang, T., Qian, J.: Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming. Optim. Lett. 13(7), 1677\u20131692 (2019)","journal-title":"Optim. Lett."},{"issue":"1","key":"2136_CR7","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01581626","volume":"19","author":"H Sherali","year":"1980","unstructured":"Sherali, H., Shetty, C.: A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts. Math. Program. 19(1), 14\u201331 (1980)","journal-title":"Math. Program."},{"issue":"3","key":"2136_CR8","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s11590-016-1016-6","volume":"11","author":"J Zhang","year":"2017","unstructured":"Zhang, J., Chen, X., Ding, X.: Degeneracy removal in cutting plane methods for disjoint bilinear programming. Optim. Lett. 11(3), 483\u2013495 (2017)","journal-title":"Optim. Lett."},{"issue":"3","key":"2136_CR9","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s101070050072","volume":"85","author":"C Audet","year":"1999","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: A symmetrical linear maxmin approach to disjoint bilinear programming. Math. Program. 85(3), 573\u2013592 (1999)","journal-title":"Math. Program."},{"issue":"1","key":"2136_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01580367","volume":"11","author":"H Konno","year":"1976","unstructured":"Konno, H.: A cutting plane algorithm for solving bilinear programs. Math. Program. 11(1), 14\u201327 (1976)","journal-title":"Math. Program."},{"issue":"1","key":"2136_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800240107","volume":"24","author":"H Vaish","year":"1977","unstructured":"Vaish, H., Shetty, C.: A cutting plane algorithm for the bilinear programming problem. Nav. Res. Logist. 24(1), 83\u201394 (1977)","journal-title":"Nav. Res. Logist."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02136-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02136-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02136-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T05:37:29Z","timestamp":1744695449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02136-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,6]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["2136"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02136-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2024,7,6]]},"assertion":[{"value":"2 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 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":"The authors have no Conflict of interest to declare that are relevant to the content of this study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}