{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T06:13:10Z","timestamp":1744697590863,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,2,15]],"date-time":"2016-02-15T00:00:00Z","timestamp":1455494400000},"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":"YETP","award":["YETP0851"],"award-info":[{"award-number":["YETP0851"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s11590-016-1016-6","type":"journal-article","created":{"date-parts":[[2016,2,15]],"date-time":"2016-02-15T09:26:06Z","timestamp":1455528366000},"page":"483-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Degeneracy removal in cutting plane methods for disjoint bilinear programming"],"prefix":"10.1007","volume":"11","author":[{"given":"Ji-hong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-song","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,15]]},"reference":[{"issue":"11","key":"1016_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0898-1221(90)90148-D","volume":"19","author":"FA Al-Khayyal","year":"1990","unstructured":"Al-Khayyal, F.A.: Jointly constrained bilinear programs and related problems: an overview. Comput. Math. Appl. 19(11), 53\u201362 (1990)","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"1016_CR2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"FA Al-Khayyal","year":"1983","unstructured":"Al-Khayyal, F.A., Falk, J.E.: Jointly constrained biconvex programming. Math. Oper. Res. 8(2), 273\u2013286 (1983)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1016_CR3","doi-asserted-by":"crossref","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":"1016_CR4","doi-asserted-by":"crossref","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":"1016_CR5","unstructured":"Balas, E.: Intersection cuts from disjunctive constraints. In: Management Science Research Report, vol. 330. Carnegie-Mellon University, Pittsburg (1974)"},{"issue":"1","key":"1016_CR6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10107-007-0184-7","volume":"118","author":"A Caprara","year":"2009","unstructured":"Caprara, A., Monaci, M.: Bidimensional packing by bilinear programming. Math. Program. 118(1), 75\u2013108 (2009)","journal-title":"Math. Program."},{"issue":"3","key":"1016_CR7","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s10898-006-9091-3","volume":"38","author":"X Ding","year":"2007","unstructured":"Ding, X., Al-Khayyal, F.A.: Accelerating convergence of cutting plane algorithms for disjoint bilinear programming. J. Glob. Optim. 38(3), 421\u2013436 (2007)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1016_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10898-008-9332-8","volume":"45","author":"CA Floudas","year":"2009","unstructured":"Floudas, C.A., Gounaris, C.E.: A review of recent advances in global optimization. J. Glob. Optim. 45(1), 3\u201338 (2009)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1016_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01593787","volume":"12","author":"G Gallo","year":"1977","unstructured":"Gallo, G., \u00dclk\u00fcc\u00fc, A.: Bilinear programming: an exact algorithm. Math. Program. 12(1), 173\u2013194 (1977)","journal-title":"Math. Program."},{"issue":"5","key":"1016_CR10","first-page":"181","volume":"18","author":"F Glover","year":"1974","unstructured":"Glover, F.: Polyhedral convexity cuts and negative edge extensions. Zeitschrift f\u00fcr Oper. Res. 18(5), 181\u2013186 (1974)","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"issue":"1","key":"1016_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01681342","volume":"9","author":"F Glover","year":"1975","unstructured":"Glover, F.: Polyhedral annexation in mixed integer and combinatorial programming. Math. Program. 9(1), 161\u2013188 (1975)","journal-title":"Math. Program."},{"key":"1016_CR12","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Berlin (2003)"},{"key":"1016_CR13","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0167-5060(08)70741-6","volume":"1","author":"RG Jeroslow","year":"1977","unstructured":"Jeroslow, R.G.: Cutting-plane theory: disjunctive methods. Ann. Discrete Math. 1, 293\u2013330 (1977)","journal-title":"Ann. Discrete Math."},{"key":"1016_CR14","unstructured":"Konno, H.: Bilinear programming: part II. Application of bilinear programming. Working paper (1971)"},{"issue":"1","key":"1016_CR15","doi-asserted-by":"crossref","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":"1016_CR16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(74)90070-3","volume":"9","author":"M Majthay","year":"1974","unstructured":"Majthay, M., Whinston, A.: Quasi-concave minimization subject to linear constraints. Discrete Math. 9(1), 35\u201359 (1974)","journal-title":"Discrete Math."},{"issue":"4","key":"1016_CR17","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1026548217241","volume":"18","author":"C Meyer","year":"2000","unstructured":"Meyer, C.: A simple finite cone covering algorithm for concave minimization. J. Glob. Optim. 18(4), 357\u2013365 (2000)","journal-title":"J. Glob. Optim."},{"key":"1016_CR18","doi-asserted-by":"crossref","unstructured":"Nahapetyan, A.: Bilinear programming: applications in the supply chain management. In: Encyclopedia of Optimization, pp. 282\u2013288. Springer, Berlin (2009)","DOI":"10.1007\/978-0-387-74759-0_49"},{"issue":"1","key":"1016_CR19","doi-asserted-by":"crossref","first-page":"71","DOI":"10.3934\/jimo.2007.3.71","volume":"3","author":"A Nahapetyan","year":"2007","unstructured":"Nahapetyan, A., Pardalos, P.M.: A bilinear relaxation based algorithm for concave piecewise linear network flow problems. J. Ind. Manag. Optim. 3(1), 71 (2007)","journal-title":"J. Ind. Manag. Optim."},{"issue":"5","key":"1016_CR20","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1016\/j.cor.2006.09.003","volume":"35","author":"A Nahapetyan","year":"2008","unstructured":"Nahapetyan, A., Pardalos, P.M.: A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems. Comput. Oper. Res. 35(5), 1601\u20131612 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1016_CR21","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF00934290","volume":"11","author":"G Owen","year":"1973","unstructured":"Owen, G.: Cutting planes for programs with disjunctive constraints. J. Optim. Theory Appl. 11(1), 49\u201355 (1973)","journal-title":"J. Optim. Theory Appl."},{"key":"1016_CR22","first-page":"3027","volume":"12","author":"M Petrik","year":"2011","unstructured":"Petrik, M., Zilberstein, S.: Robust approximate bilinear programming for value function approximation. J. Mach. Learn. Res. 12, 3027\u20133063 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"1016_CR23","doi-asserted-by":"crossref","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":"1016_CR24","doi-asserted-by":"crossref","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":"4","key":"1016_CR25","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/moor.5.4.556","volume":"5","author":"NV Thoai","year":"1980","unstructured":"Thoai, N.V., Tuy, H.: Convergent algorithms for minimizing a concave function. Math. Oper. Res. 5(4), 556\u2013566 (1980)","journal-title":"Math. Oper. Res."},{"key":"1016_CR26","first-page":"1437","volume":"5","author":"H Tuy","year":"1964","unstructured":"Tuy, H.: Concave programming under linear constraints. Soviet Math. 5, 1437\u20131440 (1964)","journal-title":"Soviet Math."},{"issue":"2","key":"1016_CR27","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/nav.3800230212","volume":"23","author":"H Vaish","year":"1976","unstructured":"Vaish, H., Shetty, C.M.: The bilinear programming problem. Naval Res. Logist. 23(2), 303\u2013309 (1976)","journal-title":"Naval Res. Logist."},{"issue":"1","key":"1016_CR28","doi-asserted-by":"crossref","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":"4","key":"1016_CR29","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1002\/aic.11425","volume":"54","author":"DS Wicaksono","year":"2008","unstructured":"Wicaksono, D.S., Karimi, I.A.: Piecewise MILP under-and overestimators for global optimization of bilinear programs. AIChE J. 54(4), 991\u20131008 (2008)","journal-title":"AIChE J."},{"issue":"6","key":"1016_CR30","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1287\/opre.21.6.1260","volume":"21","author":"PB Zwart","year":"1973","unstructured":"Zwart, P.B.: Nonlinear programming: counterexamples to two global optimization algorithms. Oper. Res. 21(6), 1260\u20131266 (1973)","journal-title":"Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1016-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1016-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1016-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1016-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:45Z","timestamp":1559394705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1016-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,15]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1016"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1016-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2016,2,15]]}}}