{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T06:13:33Z","timestamp":1744697613836,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T00:00:00Z","timestamp":1547769600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["71371032"],"award-info":[{"award-number":["71371032"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Young Faculty Research Fund of BFSU","award":["2015JT005"],"award-info":[{"award-number":["2015JT005"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2016QD010","2017JJ027"],"award-info":[{"award-number":["2016QD010","2017JJ027"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["71571020"],"award-info":[{"award-number":["71571020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s11590-018-01382-w","type":"journal-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T06:59:25Z","timestamp":1547794765000},"page":"1677-1692","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming"],"prefix":"10.1007","volume":"13","author":[{"given":"Xi","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji-hong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-song","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing-yi","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,18]]},"reference":[{"issue":"2","key":"1382_CR1","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":"3","key":"1382_CR2","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."},{"key":"1382_CR3","unstructured":"Konno, H.: Bilinear programming: Part II. Application of bilinear programming. Tech. Rept. No. 71\u201310, Department of Operations Research, Stanford University, Stanford, Calif. (1971)"},{"issue":"1","key":"1382_CR4","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."},{"key":"1382_CR5","doi-asserted-by":"crossref","unstructured":"Nahapetyan, A.: Bilinear programming: applications in the supply chain management. In: Encyclopedia of optimization, pp 282\u2013288. Springer (2009)","DOI":"10.1007\/978-0-387-74759-0_49"},{"issue":"1","key":"1382_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/nav.20257","volume":"55","author":"M Porembski","year":"2008","unstructured":"Porembski, M.: On the hierarchy of \n                    \n                      \n                    \n                    $$\\gamma $$\n                    \n                      \n                        \u03b3\n                      \n                    \n                  -valid cuts in global optimization. Naval Res. Logist. 55(1), 1\u201315 (2008)","journal-title":"Naval Res. Logist."},{"issue":"3","key":"1382_CR7","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11590-009-0114-0","volume":"3","author":"S Rebennack","year":"2009","unstructured":"Rebennack, S., Nahapetyan, A., Pardalos, P.M.: Bilinear modeling solution approach for fixed charge network flow problems. Optim. Lett. 3(3), 347\u2013355 (2009)","journal-title":"Optim. Lett."},{"issue":"1","key":"1382_CR8","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01581626","volume":"19","author":"HD Sherali","year":"1980","unstructured":"Sherali, H.D., Shetty, C.M.: 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":"1","key":"1382_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800240107","volume":"24","author":"H Vaish","year":"1977","unstructured":"Vaish, H., Shetty, C.M.: A cutting plane algorithm for the bilinear programming problem. Naval Res. Logist. 24(1), 83\u201394 (1977)","journal-title":"Naval Res. Logist."},{"issue":"3","key":"1382_CR10","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."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-01382-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-01382-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-01382-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T19:13:37Z","timestamp":1579288417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-01382-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,18]]},"references-count":10,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["1382"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-01382-w","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2019,1,18]]},"assertion":[{"value":"4 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}