{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T19:35:45Z","timestamp":1773776145380,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1007\/s10898-006-9091-3","type":"journal-article","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T13:32:53Z","timestamp":1159968773000},"page":"421-436","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Accelerating convergence of cutting plane algorithms for disjoint bilinear programming"],"prefix":"10.1007","volume":"38","author":[{"given":"Xiaosong","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faiz","family":"Al-Khayyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"issue":"11","key":"9091_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0898-1221(90)90148-D","volume":"19","author":"F. Al-Khayyal","year":"1990","unstructured":"Al-Khayyal F. (1990): Jointly constrained bilinear programs and related problems: an overview. Comput. Math. Appl. 19(11): 53\u201362","journal-title":"Comput. Math. Appl."},{"key":"9091_CR2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"F. Al-Khayyal","year":"1983","unstructured":"Al-Khayyal F., Falk J.E. (1983): Jointly constrained biconvex programming. Math. Oper. Res. 8, 273\u2013286","journal-title":"Math. Oper. Res."},{"key":"9091_CR3","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00940629","volume":"70","author":"F. Al-Khayyal","year":"1991","unstructured":"Al-Khayyal F., Kyparisis J. (1991): Finite convergence of algorithms for nonlinear programs and variational inequalities. J. Optim. Theory Appl. 70, 319\u2013332","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"9091_CR4","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. (2001): Concavity cuts for disjoint bilinear programming. Math. Program. 90(2): 373\u2013398","journal-title":"Math. Program."},{"issue":"9","key":"9091_CR5","first-page":"741","volume":"16","author":"M. Altman","year":"1968","unstructured":"Altman M. (1968): Bilinear programming. Bull D\u2019 Acad Pol. Des Sci. 16(9): 741\u2013746","journal-title":"Bull D\u2019 Acad Pol. Des Sci."},{"issue":"3","key":"9091_CR6","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. (1999): A symmetrical linear maxmin approach to disjoint bilinear programming. Math. Program. 85(3): 573\u2013592","journal-title":"Math. Program."},{"key":"9091_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E. Balas","year":"1971","unstructured":"Balas E. (1971): Intersection cuts\u2014a new type of cutting planes for integer programming. Oper. Res. 19, 19\u201339","journal-title":"Oper. Res."},{"issue":"3","key":"9091_CR8","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/S0377-2217(97)00022-2","volume":"104","author":"M. Danielson","year":"1998","unstructured":"Danielson M., Ekenberg L. (1998): A framework for analyzing decisions under risk. Eur. J. Oper. Res. 104(3): 474\u2013484","journal-title":"Eur. J. Oper. Res."},{"key":"9091_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF01580119","volume":"5","author":"J.E. Falk","year":"1973","unstructured":"Falk J.E. (1973): A linear max-min problem. Math. Program. 5, 169\u2013188","journal-title":"Math. Program."},{"key":"9091_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01593787","volume":"12","author":"G. Gallo","year":"1977","unstructured":"Gallo G., \u00dclk\u00fcc\u00fc A. (1977): Bilinear programming: an exact algorithm. Math. Program. 12, 173\u2013194","journal-title":"Math. Program."},{"key":"9091_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches, 3 rd edn","author":"R. Horst","year":"1996","unstructured":"Horst R., Tuy H. (1996): Global Optimization: Deterministic Approaches, 3\n                    rd\n                   edn. Springer-Verlag, Berlin"},{"issue":"9","key":"9091_CR12","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/0305-0548(91)90002-9","volume":"18","author":"J.J. J\u00fadice","year":"1991","unstructured":"J\u00fadice J.J., Faustino A.M. (1991): Computational analysis of LCP methods for bilinear and concave quadratic programming. Comp. Oper. Res. 18(9): 645\u2013654","journal-title":"Comp. Oper. Res."},{"key":"9091_CR13","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01580367","volume":"11","author":"H. Konno","year":"1976a","unstructured":"Konno H. (1976a): A cutting plane algorithm for solving bilinear programs. Math. Program. 11, 14\u201327","journal-title":"Math. Program."},{"key":"9091_CR14","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01580380","volume":"11","author":"H. Konno","year":"1976b","unstructured":"Konno H. (1976b): Maximization of a convex quadratic function under linear constraints. Math. Program. 11, 117\u2013127","journal-title":"Math. Program."},{"key":"9091_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(74)90070-3","volume":"9","author":"M. Majthay","year":"1974","unstructured":"Majthay M., Whinston A. (1974): Quasi-concave minimization subject to linear constraints. Discrete Math. 9, 35\u201359","journal-title":"Discrete Math."},{"key":"9091_CR16","first-page":"778","volume":"12","author":"O.L. Mangasarian","year":"1964","unstructured":"Mangasarian O.L. (1964): Equilibrium points of bimatrix games. SIAM J. 12, 778\u2013780","journal-title":"SIAM J."},{"key":"9091_CR17","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0022-247X(64)90021-6","volume":"9","author":"O.L. Mangasarian","year":"1964","unstructured":"Mangasarian O.L., Stone H. (1964): Two-person nonzero-sum games and quadratic programming. J. Math. Anal. Appl. 9, 345\u2013355","journal-title":"J. Math. Anal. Appl."},{"issue":"4","key":"9091_CR18","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1023\/A:1026548217241","volume":"18","author":"C. Meyer","year":"2000","unstructured":"Meyer C. (2000): A simple finite cone covering algorithm for concave minimization. J. Global Optim. 18(4): 357\u2013365","journal-title":"J. Global Optim."},{"key":"9091_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF00940785","volume":"77","author":"A. Shapiro","year":"1993","unstructured":"Shapiro A., Al-Khayyal F. (1993): First-order conditions for isolated locally optimal solutions. J. Optim. Theory Appl. 77, 189\u2013196","journal-title":"J. Optim. Theory Appl."},{"key":"9091_CR20","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"H.D. Sherali","year":"1992","unstructured":"Sherali H.D., Alameddine A. (1992): A new reformulation linearization algorithm for bilinear programming problems. J. of Global Optim. 2, 379\u2013410","journal-title":"J. of Global Optim."},{"key":"9091_CR21","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01581626","volume":"19","author":"H.D. Sherali","year":"1980","unstructured":"Sherali H.D., Shetty C.M. (1980): A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts. Math. Program. 19, 14\u201331","journal-title":"Math. Program."},{"key":"9091_CR22","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1287\/opre.22.2.373","volume":"22","author":"R.M. Soland","year":"1974","unstructured":"Soland R.M. (1974): Optimal facility location with concave costs. Oper. Res. 22, 373\u2013382","journal-title":"Oper. Res."},{"key":"9091_CR23","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01580766","volume":"41","author":"T.V. Thieu","year":"1988","unstructured":"Thieu T.V. (1988): A note on the solution of bilinear problems by reduction to concave minimization. Math. Program. 41, 249\u2013260","journal-title":"Math. Program."},{"key":"9091_CR24","first-page":"1437","volume":"5","author":"H. Tuy","year":"1964","unstructured":"Tuy H. (1964): Concave programming under linear constraints. Soviet Math. 5, 1437\u20131440","journal-title":"Soviet Math."},{"key":"9091_CR25","doi-asserted-by":"crossref","unstructured":"Tuy, H. (1995): DC optimization: theory, methods and algorithms. In: Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht","DOI":"10.1007\/978-1-4615-2025-2_4"},{"key":"9091_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2809-5","volume-title":"Convex Analysis and Global Optimization","author":"H. Tuy","year":"1998","unstructured":"Tuy H. (1998): Convex Analysis and Global Optimization. Kluwer Academic Publishers, Dotdrecht"},{"key":"9091_CR27","first-page":"303","volume":"23","author":"H. Vaish","year":"1976","unstructured":"Vaish H., Shetty C.M. (1976): The bilinear programming problem. Math. Program. 23, 303\u2013309","journal-title":"Math. Program."},{"key":"9091_CR28","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. (1977): A cutting plane algorithm for the bilinear programming problem. Naval Res. Logist. Quart. 24, 83\u201394","journal-title":"Naval Res. Logist. Quart."},{"key":"9091_CR29","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01580892","volume":"56","author":"D.J. White","year":"1992","unstructured":"White D.J. (1992): A linear programming approach to solving bilinear programmes. Math. Program. 56, 45\u201350","journal-title":"Math. Program."},{"key":"9091_CR30","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF00119989","volume":"1","author":"Y. Yajima","year":"1991","unstructured":"Yajima Y., Konno H. (1991): An efficient algorithm for solving rank two and rank three bilinear programming problems. J. Global Optim. 1, 155\u2013171","journal-title":"J. Global Optim."},{"issue":"6","key":"9091_CR31","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1287\/opre.21.6.1260","volume":"21","author":"P. Zwart","year":"1973","unstructured":"Zwart P. (1973): Nonlinear programming: counterexamples to two global optimization algorithms. Oper. Res. 21(6): 1260\u20131266","journal-title":"Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9091-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-006-9091-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9091-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9091-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T19:32:04Z","timestamp":1652815924000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-006-9091-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,5]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["9091"],"URL":"https:\/\/doi.org\/10.1007\/s10898-006-9091-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,5]]},"assertion":[{"value":"4 August 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}